/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 13:02:17,851 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 13:02:17,859 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 13:02:17,893 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 13:02:17,893 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 13:02:17,894 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 13:02:17,896 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 13:02:17,900 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 13:02:17,901 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 13:02:17,905 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 13:02:17,905 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 13:02:17,906 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 13:02:17,906 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 13:02:17,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 13:02:17,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 13:02:17,911 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 13:02:17,911 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 13:02:17,912 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 13:02:17,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 13:02:17,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 13:02:17,914 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 13:02:17,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 13:02:17,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 13:02:17,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 13:02:17,919 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 13:02:17,926 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 13:02:17,926 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 13:02:17,926 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 13:02:17,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 13:02:17,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 13:02:17,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 13:02:17,928 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 13:02:17,929 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 13:02:17,930 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 13:02:17,930 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 13:02:17,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 13:02:17,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 13:02:17,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 13:02:17,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 13:02:17,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 13:02:17,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 13:02:17,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 13:02:17,934 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-07 13:02:17,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 13:02:17,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 13:02:17,957 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-07 13:02:17,957 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-07 13:02:17,958 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-07 13:02:17,958 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-07 13:02:17,958 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-07 13:02:17,958 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-07 13:02:17,958 INFO L138 SettingsManager]: * Use SBE=true [2022-04-07 13:02:17,959 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 13:02:17,959 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 13:02:17,959 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 13:02:17,959 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 13:02:17,959 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 13:02:17,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 13:02:17,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 13:02:17,960 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 13:02:17,960 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 13:02:17,960 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 13:02:17,960 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 13:02:17,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 13:02:17,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 13:02:17,960 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 13:02:17,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 13:02:17,960 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:17,960 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 13:02:17,960 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-07 13:02:17,961 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-07 13:02:17,961 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 13:02:17,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-07 13:02:17,961 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-07 13:02:17,961 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-07 13:02:17,961 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-07 13:02:17,961 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-07 13:02:18,138 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 13:02:18,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 13:02:18,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 13:02:18,160 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 13:02:18,160 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 13:02:18,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2022-04-07 13:02:18,207 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf80248d/515f306d81c544df82315284d469f789/FLAG5c4e573e4 [2022-04-07 13:02:18,558 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 13:02:18,559 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c [2022-04-07 13:02:18,562 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf80248d/515f306d81c544df82315284d469f789/FLAG5c4e573e4 [2022-04-07 13:02:18,571 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bf80248d/515f306d81c544df82315284d469f789 [2022-04-07 13:02:18,573 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 13:02:18,573 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-07 13:02:18,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:18,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 13:02:18,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 13:02:18,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,578 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f75900d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18, skipping insertion in model container [2022-04-07 13:02:18,578 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,583 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 13:02:18,599 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 13:02:18,707 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c[525,538] [2022-04-07 13:02:18,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:18,746 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 13:02:18,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/dijkstra-u_unwindbound100.c[525,538] [2022-04-07 13:02:18,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 13:02:18,777 INFO L208 MainTranslator]: Completed translation [2022-04-07 13:02:18,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18 WrapperNode [2022-04-07 13:02:18,778 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 13:02:18,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 13:02:18,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 13:02:18,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 13:02:18,785 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 13:02:18,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 13:02:18,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 13:02:18,802 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 13:02:18,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18" (1/1) ... [2022-04-07 13:02:18,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 13:02:18,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:18,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-07 13:02:18,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-07 13:02:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 13:02:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 13:02:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 13:02:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 13:02:18,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 13:02:18,849 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 13:02:18,849 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 13:02:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 13:02:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 13:02:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 13:02:18,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 13:02:18,891 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 13:02:18,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 13:02:19,076 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 13:02:19,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 13:02:19,082 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 13:02:19,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:19 BoogieIcfgContainer [2022-04-07 13:02:19,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 13:02:19,084 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 13:02:19,084 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 13:02:19,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 13:02:19,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 01:02:18" (1/3) ... [2022-04-07 13:02:19,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd6b365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:19, skipping insertion in model container [2022-04-07 13:02:19,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 01:02:18" (2/3) ... [2022-04-07 13:02:19,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cd6b365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 01:02:19, skipping insertion in model container [2022-04-07 13:02:19,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 01:02:19" (3/3) ... [2022-04-07 13:02:19,088 INFO L111 eAbstractionObserver]: Analyzing ICFG dijkstra-u_unwindbound100.c [2022-04-07 13:02:19,091 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-07 13:02:19,091 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 13:02:19,125 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 13:02:19,130 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-07 13:02:19,130 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 13:02:19,143 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 13:02:19,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-07 13:02:19,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:19,146 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:19,147 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:19,150 INFO L85 PathProgramCache]: Analyzing trace with hash -2024343623, now seen corresponding path program 1 times [2022-04-07 13:02:19,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:19,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381716061] [2022-04-07 13:02:19,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:19,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:19,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:19,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:19,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-07 13:02:19,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:19,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:19,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:19,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:19,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:19,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:19,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:19,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:19,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} call ULTIMATE.init(); {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:02:19,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {51#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {42#true} is VALID [2022-04-07 13:02:19,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume true; {42#true} is VALID [2022-04-07 13:02:19,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} #102#return; {42#true} is VALID [2022-04-07 13:02:19,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} call #t~ret7 := main(); {42#true} is VALID [2022-04-07 13:02:19,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {42#true} is VALID [2022-04-07 13:02:19,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {42#true} is VALID [2022-04-07 13:02:19,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} ~cond := #in~cond; {42#true} is VALID [2022-04-07 13:02:19,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} assume 0 == ~cond;assume false; {43#false} is VALID [2022-04-07 13:02:19,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {43#false} assume true; {43#false} is VALID [2022-04-07 13:02:19,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {43#false} {42#true} #82#return; {43#false} is VALID [2022-04-07 13:02:19,297 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {43#false} is VALID [2022-04-07 13:02:19,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:19,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-04-07 13:02:19,297 INFO L272 TraceCheckUtils]: 14: Hoare triple {43#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {43#false} is VALID [2022-04-07 13:02:19,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} ~cond := #in~cond; {43#false} is VALID [2022-04-07 13:02:19,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume 0 == ~cond; {43#false} is VALID [2022-04-07 13:02:19,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-04-07 13:02:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:19,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:19,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381716061] [2022-04-07 13:02:19,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381716061] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:19,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:19,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 13:02:19,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063824509] [2022-04-07 13:02:19,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:19,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 13:02:19,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:19,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:19,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:19,344 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 13:02:19,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:19,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 13:02:19,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:02:19,365 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:23,616 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:24,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:24,461 INFO L93 Difference]: Finished difference Result 70 states and 111 transitions. [2022-04-07 13:02:24,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 13:02:24,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-07 13:02:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:24,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:24,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-04-07 13:02:24,475 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-04-07 13:02:24,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:24,670 INFO L225 Difference]: With dead ends: 70 [2022-04-07 13:02:24,670 INFO L226 Difference]: Without dead ends: 35 [2022-04-07 13:02:24,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 13:02:24,674 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 11 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:24,675 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 53 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 25 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-07 13:02:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-07 13:02:24,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-04-07 13:02:24,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:24,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:24,696 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:24,697 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:24,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:24,700 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:24,701 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:24,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:24,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:24,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-07 13:02:24,702 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 35 states. [2022-04-07 13:02:24,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:24,706 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-07 13:02:24,706 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-07 13:02:24,706 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:24,706 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:24,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:24,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:24,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:24,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-04-07 13:02:24,710 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 18 [2022-04-07 13:02:24,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:24,711 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-04-07 13:02:24,711 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-04-07 13:02:24,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-07 13:02:24,712 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:24,712 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:24,712 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 13:02:24,713 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:24,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:24,713 INFO L85 PathProgramCache]: Analyzing trace with hash -96361696, now seen corresponding path program 1 times [2022-04-07 13:02:24,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:24,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907483778] [2022-04-07 13:02:24,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:24,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:24,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:24,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1791627778] [2022-04-07 13:02:24,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:24,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:24,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:24,748 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:02:24,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-07 13:02:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:24,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 13:02:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:24,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:24,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2022-04-07 13:02:24,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {282#(<= ~counter~0 0)} {274#true} #102#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {282#(<= ~counter~0 0)} call #t~ret7 := main(); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {282#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,960 INFO L272 TraceCheckUtils]: 6: Hoare triple {282#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {282#(<= ~counter~0 0)} ~cond := #in~cond; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,961 INFO L290 TraceCheckUtils]: 8: Hoare triple {282#(<= ~counter~0 0)} assume !(0 == ~cond); {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {282#(<= ~counter~0 0)} assume true; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,962 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {282#(<= ~counter~0 0)} {282#(<= ~counter~0 0)} #82#return; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {282#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {282#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:24,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {282#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {316#(<= |main_#t~post5| 0)} is VALID [2022-04-07 13:02:24,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {316#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {275#false} is VALID [2022-04-07 13:02:24,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {275#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {275#false} is VALID [2022-04-07 13:02:24,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {275#false} assume !(#t~post6 < 100);havoc #t~post6; {275#false} is VALID [2022-04-07 13:02:24,963 INFO L272 TraceCheckUtils]: 16: Hoare triple {275#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {275#false} is VALID [2022-04-07 13:02:24,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {275#false} ~cond := #in~cond; {275#false} is VALID [2022-04-07 13:02:24,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {275#false} assume 0 == ~cond; {275#false} is VALID [2022-04-07 13:02:24,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {275#false} assume !false; {275#false} is VALID [2022-04-07 13:02:24,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:24,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:24,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907483778] [2022-04-07 13:02:24,965 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:24,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791627778] [2022-04-07 13:02:24,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791627778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:24,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:24,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 13:02:24,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724403280] [2022-04-07 13:02:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:24,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 13:02:24,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:24,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:24,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:24,993 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 13:02:24,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:24,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 13:02:24,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 13:02:24,994 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:30,170 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2022-04-07 13:02:30,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 13:02:30,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-07 13:02:30,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:30,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:30,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:30,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2022-04-07 13:02:30,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2022-04-07 13:02:30,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:30,259 INFO L225 Difference]: With dead ends: 55 [2022-04-07 13:02:30,259 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 13:02:30,260 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 13:02:30,261 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:30,261 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:02:30,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 13:02:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 13:02:30,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:30,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:30,268 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:30,268 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:30,270 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:30,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:30,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:30,271 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 13:02:30,272 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 13:02:30,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:30,274 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-07 13:02:30,274 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:30,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:30,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:30,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:30,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:30,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.3) internal successors, (26), 21 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:30,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-04-07 13:02:30,276 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 20 [2022-04-07 13:02:30,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:30,277 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-04-07 13:02:30,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-07 13:02:30,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:30,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:30,277 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:30,294 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 13:02:30,494 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:30,494 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:30,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:30,495 INFO L85 PathProgramCache]: Analyzing trace with hash 962099791, now seen corresponding path program 1 times [2022-04-07 13:02:30,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:30,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881398213] [2022-04-07 13:02:30,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:30,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:30,510 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:30,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1695271795] [2022-04-07 13:02:30,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:30,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:30,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:30,514 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:02:30,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-07 13:02:30,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:30,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:02:30,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:30,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:30,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {546#true} call ULTIMATE.init(); {546#true} is VALID [2022-04-07 13:02:30,667 INFO L290 TraceCheckUtils]: 1: Hoare triple {546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,668 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#(<= ~counter~0 0)} {546#true} #102#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#(<= ~counter~0 0)} call #t~ret7 := main(); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,671 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#(<= ~counter~0 0)} ~cond := #in~cond; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#(<= ~counter~0 0)} assume !(0 == ~cond); {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#(<= ~counter~0 0)} assume true; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,674 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#(<= ~counter~0 0)} {554#(<= ~counter~0 0)} #82#return; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,675 INFO L290 TraceCheckUtils]: 11: Hoare triple {554#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {554#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:30,675 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:30,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {588#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:30,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {588#(<= ~counter~0 1)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {588#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:30,677 INFO L290 TraceCheckUtils]: 15: Hoare triple {588#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {598#(<= |main_#t~post6| 1)} is VALID [2022-04-07 13:02:30,677 INFO L290 TraceCheckUtils]: 16: Hoare triple {598#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {547#false} is VALID [2022-04-07 13:02:30,677 INFO L272 TraceCheckUtils]: 17: Hoare triple {547#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {547#false} is VALID [2022-04-07 13:02:30,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {547#false} ~cond := #in~cond; {547#false} is VALID [2022-04-07 13:02:30,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {547#false} assume 0 == ~cond; {547#false} is VALID [2022-04-07 13:02:30,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {547#false} assume !false; {547#false} is VALID [2022-04-07 13:02:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:30,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:02:30,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:30,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881398213] [2022-04-07 13:02:30,679 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:30,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1695271795] [2022-04-07 13:02:30,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1695271795] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:30,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:30,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:02:30,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669165073] [2022-04-07 13:02:30,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:30,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 13:02:30,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:30,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:30,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:30,696 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:02:30,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:30,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:02:30,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:02:30,697 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:31,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:31,899 INFO L93 Difference]: Finished difference Result 49 states and 64 transitions. [2022-04-07 13:02:31,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:02:31,899 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-07 13:02:31,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:31,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:31,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:31,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:31,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2022-04-07 13:02:31,903 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 64 transitions. [2022-04-07 13:02:31,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:31,953 INFO L225 Difference]: With dead ends: 49 [2022-04-07 13:02:31,953 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 13:02:31,953 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:02:31,954 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:31,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 120 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:02:31,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 13:02:31,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2022-04-07 13:02:31,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:31,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:31,960 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:31,961 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:31,963 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:31,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:31,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:31,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-07 13:02:31,964 INFO L87 Difference]: Start difference. First operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 40 states. [2022-04-07 13:02:31,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:31,980 INFO L93 Difference]: Finished difference Result 40 states and 53 transitions. [2022-04-07 13:02:31,980 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 53 transitions. [2022-04-07 13:02:31,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:31,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:31,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:31,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 13:02:31,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-04-07 13:02:31,983 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 21 [2022-04-07 13:02:31,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:31,983 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-04-07 13:02:31,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-07 13:02:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-04-07 13:02:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-07 13:02:31,983 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:31,984 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:32,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 13:02:32,184 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-07 13:02:32,184 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:32,185 INFO L85 PathProgramCache]: Analyzing trace with hash 963589341, now seen corresponding path program 1 times [2022-04-07 13:02:32,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:32,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369334339] [2022-04-07 13:02:32,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:32,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:02:32,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:32,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-07 13:02:32,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:32,375 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:32,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:02:32,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:32,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:32,382 INFO L290 TraceCheckUtils]: 1: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:32,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:32,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:32,382 INFO L272 TraceCheckUtils]: 0: Hoare triple {822#true} call ULTIMATE.init(); {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:02:32,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {835#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {822#true} is VALID [2022-04-07 13:02:32,383 INFO L290 TraceCheckUtils]: 2: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:32,383 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {822#true} {822#true} #102#return; {822#true} is VALID [2022-04-07 13:02:32,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {822#true} call #t~ret7 := main(); {822#true} is VALID [2022-04-07 13:02:32,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {822#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {822#true} is VALID [2022-04-07 13:02:32,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {822#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {822#true} is VALID [2022-04-07 13:02:32,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {822#true} ~cond := #in~cond; {822#true} is VALID [2022-04-07 13:02:32,385 INFO L290 TraceCheckUtils]: 8: Hoare triple {822#true} assume !(0 == ~cond); {822#true} is VALID [2022-04-07 13:02:32,387 INFO L290 TraceCheckUtils]: 9: Hoare triple {822#true} assume true; {822#true} is VALID [2022-04-07 13:02:32,387 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {822#true} {822#true} #82#return; {822#true} is VALID [2022-04-07 13:02:32,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {822#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:32,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:32,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} is VALID [2022-04-07 13:02:32,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {831#(and (= main_~p~0 0) (= main_~n~0 main_~r~0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:32,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:32,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} is VALID [2022-04-07 13:02:32,394 INFO L272 TraceCheckUtils]: 17: Hoare triple {832#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {833#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:02:32,394 INFO L290 TraceCheckUtils]: 18: Hoare triple {833#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {834#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:02:32,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {834#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {823#false} is VALID [2022-04-07 13:02:32,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {823#false} assume !false; {823#false} is VALID [2022-04-07 13:02:32,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:32,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:32,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369334339] [2022-04-07 13:02:32,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369334339] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:02:32,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:02:32,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-07 13:02:32,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71286575] [2022-04-07 13:02:32,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:02:32,397 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 13:02:32,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:32,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:32,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:32,421 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 13:02:32,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:32,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 13:02:32,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-07 13:02:32,422 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:40,125 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:42,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:44,256 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:50,637 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:02:54,354 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:02:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:54,418 INFO L93 Difference]: Finished difference Result 72 states and 104 transitions. [2022-04-07 13:02:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 13:02:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-07 13:02:54,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:02:54,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-07 13:02:54,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:54,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-07 13:02:54,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-07 13:02:54,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:54,676 INFO L225 Difference]: With dead ends: 72 [2022-04-07 13:02:54,676 INFO L226 Difference]: Without dead ends: 51 [2022-04-07 13:02:54,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-07 13:02:54,677 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 24 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 37 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2022-04-07 13:02:54,678 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 107 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 204 Invalid, 5 Unknown, 0 Unchecked, 16.3s Time] [2022-04-07 13:02:54,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-07 13:02:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-04-07 13:02:54,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:02:54,694 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:02:54,694 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:02:54,694 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:02:54,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:54,696 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 13:02:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:02:54,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:54,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:54,697 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 13:02:54,697 INFO L87 Difference]: Start difference. First operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 51 states. [2022-04-07 13:02:54,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:02:54,699 INFO L93 Difference]: Finished difference Result 51 states and 69 transitions. [2022-04-07 13:02:54,699 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:02:54,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:02:54,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:02:54,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:02:54,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:02:54,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 19 states have call successors, (19), 5 states have call predecessors, (19), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:02:54,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 69 transitions. [2022-04-07 13:02:54,702 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 69 transitions. Word has length 21 [2022-04-07 13:02:54,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:02:54,702 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 69 transitions. [2022-04-07 13:02:54,702 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:02:54,702 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 69 transitions. [2022-04-07 13:02:54,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 13:02:54,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:02:54,702 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:02:54,702 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-07 13:02:54,703 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:02:54,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:02:54,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1701877900, now seen corresponding path program 1 times [2022-04-07 13:02:54,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:02:54,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16397275] [2022-04-07 13:02:54,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:54,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:02:54,712 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:02:54,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [776888933] [2022-04-07 13:02:54,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:02:54,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:02:54,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:02:54,714 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:02:54,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-07 13:02:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:54,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:02:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:02:54,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:02:54,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-07 13:02:54,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1145#(<= ~counter~0 0)} {1137#true} #102#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,889 INFO L272 TraceCheckUtils]: 4: Hoare triple {1145#(<= ~counter~0 0)} call #t~ret7 := main(); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {1145#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,890 INFO L272 TraceCheckUtils]: 6: Hoare triple {1145#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {1145#(<= ~counter~0 0)} ~cond := #in~cond; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {1145#(<= ~counter~0 0)} assume !(0 == ~cond); {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {1145#(<= ~counter~0 0)} assume true; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,892 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1145#(<= ~counter~0 0)} {1145#(<= ~counter~0 0)} #82#return; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,892 INFO L290 TraceCheckUtils]: 11: Hoare triple {1145#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1145#(<= ~counter~0 0)} is VALID [2022-04-07 13:02:54,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {1145#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:54,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {1179#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:54,893 INFO L290 TraceCheckUtils]: 14: Hoare triple {1179#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1179#(<= ~counter~0 1)} is VALID [2022-04-07 13:02:54,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {1179#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1189#(<= |main_#t~post5| 1)} is VALID [2022-04-07 13:02:54,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {1189#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {1138#false} is VALID [2022-04-07 13:02:54,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-07 13:02:54,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 100);havoc #t~post6; {1138#false} is VALID [2022-04-07 13:02:54,894 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-07 13:02:54,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-07 13:02:54,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-07 13:02:54,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-07 13:02:54,895 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:54,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:02:55,033 INFO L290 TraceCheckUtils]: 22: Hoare triple {1138#false} assume !false; {1138#false} is VALID [2022-04-07 13:02:55,033 INFO L290 TraceCheckUtils]: 21: Hoare triple {1138#false} assume 0 == ~cond; {1138#false} is VALID [2022-04-07 13:02:55,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {1138#false} ~cond := #in~cond; {1138#false} is VALID [2022-04-07 13:02:55,033 INFO L272 TraceCheckUtils]: 19: Hoare triple {1138#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1138#false} is VALID [2022-04-07 13:02:55,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {1138#false} assume !(#t~post6 < 100);havoc #t~post6; {1138#false} is VALID [2022-04-07 13:02:55,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {1138#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1138#false} is VALID [2022-04-07 13:02:55,036 INFO L290 TraceCheckUtils]: 16: Hoare triple {1229#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {1138#false} is VALID [2022-04-07 13:02:55,036 INFO L290 TraceCheckUtils]: 15: Hoare triple {1233#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1229#(< |main_#t~post5| 100)} is VALID [2022-04-07 13:02:55,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {1233#(< ~counter~0 100)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1233#(< ~counter~0 100)} is VALID [2022-04-07 13:02:55,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {1233#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {1233#(< ~counter~0 100)} is VALID [2022-04-07 13:02:55,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {1243#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1233#(< ~counter~0 100)} is VALID [2022-04-07 13:02:55,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {1243#(< ~counter~0 99)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1243#(< ~counter~0 99)} is VALID [2022-04-07 13:02:55,044 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1137#true} {1243#(< ~counter~0 99)} #82#return; {1243#(< ~counter~0 99)} is VALID [2022-04-07 13:02:55,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {1137#true} assume true; {1137#true} is VALID [2022-04-07 13:02:55,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {1137#true} assume !(0 == ~cond); {1137#true} is VALID [2022-04-07 13:02:55,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {1137#true} ~cond := #in~cond; {1137#true} is VALID [2022-04-07 13:02:55,045 INFO L272 TraceCheckUtils]: 6: Hoare triple {1243#(< ~counter~0 99)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1137#true} is VALID [2022-04-07 13:02:55,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {1243#(< ~counter~0 99)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1243#(< ~counter~0 99)} is VALID [2022-04-07 13:02:55,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {1243#(< ~counter~0 99)} call #t~ret7 := main(); {1243#(< ~counter~0 99)} is VALID [2022-04-07 13:02:55,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1243#(< ~counter~0 99)} {1137#true} #102#return; {1243#(< ~counter~0 99)} is VALID [2022-04-07 13:02:55,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {1243#(< ~counter~0 99)} assume true; {1243#(< ~counter~0 99)} is VALID [2022-04-07 13:02:55,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {1137#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1243#(< ~counter~0 99)} is VALID [2022-04-07 13:02:55,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {1137#true} call ULTIMATE.init(); {1137#true} is VALID [2022-04-07 13:02:55,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:02:55,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:02:55,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16397275] [2022-04-07 13:02:55,047 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:02:55,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [776888933] [2022-04-07 13:02:55,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [776888933] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:02:55,047 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:02:55,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-07 13:02:55,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384073724] [2022-04-07 13:02:55,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:02:55,048 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-07 13:02:55,048 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:02:55,048 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:02:55,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:02:55,071 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 13:02:55,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:02:55,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 13:02:55,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-07 13:02:55,072 INFO L87 Difference]: Start difference. First operand 51 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:08,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:13,460 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:14,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:14,718 INFO L93 Difference]: Finished difference Result 104 states and 146 transitions. [2022-04-07 13:03:14,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 13:03:14,718 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2022-04-07 13:03:14,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:14,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:14,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-07 13:03:14,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:14,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 143 transitions. [2022-04-07 13:03:14,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 143 transitions. [2022-04-07 13:03:14,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:14,834 INFO L225 Difference]: With dead ends: 104 [2022-04-07 13:03:14,834 INFO L226 Difference]: Without dead ends: 85 [2022-04-07 13:03:14,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-07 13:03:14,835 INFO L913 BasicCegarLoop]: 61 mSDtfsCounter, 72 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 28 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:14,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 256 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 86 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2022-04-07 13:03:14,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-07 13:03:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 63. [2022-04-07 13:03:14,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:14,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:14,857 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:14,857 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:14,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:14,860 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2022-04-07 13:03:14,860 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2022-04-07 13:03:14,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:14,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:14,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 85 states. [2022-04-07 13:03:14,861 INFO L87 Difference]: Start difference. First operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 85 states. [2022-04-07 13:03:14,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:14,866 INFO L93 Difference]: Finished difference Result 85 states and 114 transitions. [2022-04-07 13:03:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 114 transitions. [2022-04-07 13:03:14,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:14,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:14,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:14,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:14,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 38 states have (on average 1.263157894736842) internal successors, (48), 40 states have internal predecessors, (48), 19 states have call successors, (19), 6 states have call predecessors, (19), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-07 13:03:14,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2022-04-07 13:03:14,870 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 23 [2022-04-07 13:03:14,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:14,871 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2022-04-07 13:03:14,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:14,871 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-04-07 13:03:14,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:03:14,872 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:14,872 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:03:14,890 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-07 13:03:15,076 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:15,077 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:15,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1564262277, now seen corresponding path program 1 times [2022-04-07 13:03:15,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:15,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202683270] [2022-04-07 13:03:15,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:15,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:15,091 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:03:15,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1793755906] [2022-04-07 13:03:15,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:15,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:15,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:15,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:03:15,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 13:03:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:15,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:03:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:15,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:15,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2022-04-07 13:03:15,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {1705#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {1713#(<= ~counter~0 0)} assume true; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1713#(<= ~counter~0 0)} {1705#true} #102#return; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {1713#(<= ~counter~0 0)} call #t~ret7 := main(); {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {1713#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,294 INFO L272 TraceCheckUtils]: 6: Hoare triple {1713#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {1713#(<= ~counter~0 0)} ~cond := #in~cond; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {1713#(<= ~counter~0 0)} assume !(0 == ~cond); {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {1713#(<= ~counter~0 0)} assume true; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,296 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1713#(<= ~counter~0 0)} {1713#(<= ~counter~0 0)} #82#return; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {1713#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1713#(<= ~counter~0 0)} is VALID [2022-04-07 13:03:15,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {1713#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1747#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:15,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {1747#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1747#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:15,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {1747#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1747#(<= ~counter~0 1)} is VALID [2022-04-07 13:03:15,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {1747#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:15,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {1757#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:15,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {1757#(<= ~counter~0 2)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1757#(<= ~counter~0 2)} is VALID [2022-04-07 13:03:15,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {1757#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1767#(<= |main_#t~post6| 2)} is VALID [2022-04-07 13:03:15,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {1767#(<= |main_#t~post6| 2)} assume !(#t~post6 < 100);havoc #t~post6; {1706#false} is VALID [2022-04-07 13:03:15,298 INFO L272 TraceCheckUtils]: 20: Hoare triple {1706#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1706#false} is VALID [2022-04-07 13:03:15,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {1706#false} ~cond := #in~cond; {1706#false} is VALID [2022-04-07 13:03:15,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {1706#false} assume 0 == ~cond; {1706#false} is VALID [2022-04-07 13:03:15,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2022-04-07 13:03:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:15,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:15,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {1706#false} assume !false; {1706#false} is VALID [2022-04-07 13:03:15,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {1706#false} assume 0 == ~cond; {1706#false} is VALID [2022-04-07 13:03:15,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {1706#false} ~cond := #in~cond; {1706#false} is VALID [2022-04-07 13:03:15,450 INFO L272 TraceCheckUtils]: 20: Hoare triple {1706#false} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 + 16 * ~n~0 * ~p~0 + 12 * ~h~0 * ~r~0 - 16 * ~p~0 * ~r~0 - ~h~0 - 4 * ~p~0) % 4294967296 then 1 else 0)); {1706#false} is VALID [2022-04-07 13:03:15,451 INFO L290 TraceCheckUtils]: 19: Hoare triple {1795#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {1706#false} is VALID [2022-04-07 13:03:15,451 INFO L290 TraceCheckUtils]: 18: Hoare triple {1799#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1795#(< |main_#t~post6| 100)} is VALID [2022-04-07 13:03:15,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {1799#(< ~counter~0 100)} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {1799#(< ~counter~0 100)} is VALID [2022-04-07 13:03:15,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {1799#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {1799#(< ~counter~0 100)} is VALID [2022-04-07 13:03:15,452 INFO L290 TraceCheckUtils]: 15: Hoare triple {1809#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1799#(< ~counter~0 100)} is VALID [2022-04-07 13:03:15,452 INFO L290 TraceCheckUtils]: 14: Hoare triple {1809#(< ~counter~0 99)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {1809#(< ~counter~0 99)} is VALID [2022-04-07 13:03:15,453 INFO L290 TraceCheckUtils]: 13: Hoare triple {1809#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {1809#(< ~counter~0 99)} is VALID [2022-04-07 13:03:15,453 INFO L290 TraceCheckUtils]: 12: Hoare triple {1819#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1809#(< ~counter~0 99)} is VALID [2022-04-07 13:03:15,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {1819#(< ~counter~0 98)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {1819#(< ~counter~0 98)} is VALID [2022-04-07 13:03:15,454 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1705#true} {1819#(< ~counter~0 98)} #82#return; {1819#(< ~counter~0 98)} is VALID [2022-04-07 13:03:15,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {1705#true} assume true; {1705#true} is VALID [2022-04-07 13:03:15,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {1705#true} assume !(0 == ~cond); {1705#true} is VALID [2022-04-07 13:03:15,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {1705#true} ~cond := #in~cond; {1705#true} is VALID [2022-04-07 13:03:15,455 INFO L272 TraceCheckUtils]: 6: Hoare triple {1819#(< ~counter~0 98)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {1705#true} is VALID [2022-04-07 13:03:15,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {1819#(< ~counter~0 98)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {1819#(< ~counter~0 98)} is VALID [2022-04-07 13:03:15,456 INFO L272 TraceCheckUtils]: 4: Hoare triple {1819#(< ~counter~0 98)} call #t~ret7 := main(); {1819#(< ~counter~0 98)} is VALID [2022-04-07 13:03:15,456 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1819#(< ~counter~0 98)} {1705#true} #102#return; {1819#(< ~counter~0 98)} is VALID [2022-04-07 13:03:15,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {1819#(< ~counter~0 98)} assume true; {1819#(< ~counter~0 98)} is VALID [2022-04-07 13:03:15,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {1705#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1819#(< ~counter~0 98)} is VALID [2022-04-07 13:03:15,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {1705#true} call ULTIMATE.init(); {1705#true} is VALID [2022-04-07 13:03:15,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:15,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:15,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202683270] [2022-04-07 13:03:15,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:03:15,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1793755906] [2022-04-07 13:03:15,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1793755906] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:15,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 13:03:15,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-07 13:03:15,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030538947] [2022-04-07 13:03:15,459 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:15,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-07 13:03:15,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:15,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:15,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:15,486 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 13:03:15,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:15,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 13:03:15,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 13:03:15,486 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:18,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:27,985 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:32,663 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:34,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:39,179 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:03:44,017 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:44,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:44,508 INFO L93 Difference]: Finished difference Result 138 states and 192 transitions. [2022-04-07 13:03:44,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 13:03:44,508 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2022-04-07 13:03:44,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:03:44,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:44,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-07 13:03:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:44,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 189 transitions. [2022-04-07 13:03:44,513 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 189 transitions. [2022-04-07 13:03:44,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:44,665 INFO L225 Difference]: With dead ends: 138 [2022-04-07 13:03:44,665 INFO L226 Difference]: Without dead ends: 129 [2022-04-07 13:03:44,666 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-04-07 13:03:44,666 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 162 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 108 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:03:44,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 319 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 122 Invalid, 5 Unknown, 0 Unchecked, 18.0s Time] [2022-04-07 13:03:44,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-07 13:03:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2022-04-07 13:03:44,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:03:44,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 120 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 70 states have internal predecessors, (87), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:03:44,710 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 120 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 70 states have internal predecessors, (87), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:03:44,710 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 120 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 70 states have internal predecessors, (87), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:03:44,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:44,714 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2022-04-07 13:03:44,714 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2022-04-07 13:03:44,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:44,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:44,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 70 states have internal predecessors, (87), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 129 states. [2022-04-07 13:03:44,716 INFO L87 Difference]: Start difference. First operand has 120 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 70 states have internal predecessors, (87), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand 129 states. [2022-04-07 13:03:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:03:44,719 INFO L93 Difference]: Finished difference Result 129 states and 178 transitions. [2022-04-07 13:03:44,719 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 178 transitions. [2022-04-07 13:03:44,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:03:44,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:03:44,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:03:44,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:03:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.3384615384615384) internal successors, (87), 70 states have internal predecessors, (87), 46 states have call successors, (46), 9 states have call predecessors, (46), 8 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2022-04-07 13:03:44,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 173 transitions. [2022-04-07 13:03:44,723 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 173 transitions. Word has length 24 [2022-04-07 13:03:44,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:03:44,724 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 173 transitions. [2022-04-07 13:03:44,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 10 states have internal predecessors, (33), 4 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-07 13:03:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 173 transitions. [2022-04-07 13:03:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 13:03:44,724 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:03:44,724 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:03:44,740 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 13:03:44,937 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:44,938 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:03:44,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:03:44,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1562772727, now seen corresponding path program 1 times [2022-04-07 13:03:44,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:03:44,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019390551] [2022-04-07 13:03:44,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:44,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:03:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:45,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:03:45,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:45,080 INFO L290 TraceCheckUtils]: 0: Hoare triple {2523#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2509#true} is VALID [2022-04-07 13:03:45,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {2509#true} assume true; {2509#true} is VALID [2022-04-07 13:03:45,080 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2509#true} {2509#true} #102#return; {2509#true} is VALID [2022-04-07 13:03:45,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:03:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:45,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {2509#true} ~cond := #in~cond; {2509#true} is VALID [2022-04-07 13:03:45,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {2509#true} assume !(0 == ~cond); {2509#true} is VALID [2022-04-07 13:03:45,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2022-04-07 13:03:45,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #82#return; {2509#true} is VALID [2022-04-07 13:03:45,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2523#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:03:45,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {2523#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2509#true} is VALID [2022-04-07 13:03:45,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2022-04-07 13:03:45,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #102#return; {2509#true} is VALID [2022-04-07 13:03:45,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {2509#true} call #t~ret7 := main(); {2509#true} is VALID [2022-04-07 13:03:45,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {2509#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2509#true} is VALID [2022-04-07 13:03:45,086 INFO L272 TraceCheckUtils]: 6: Hoare triple {2509#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2509#true} is VALID [2022-04-07 13:03:45,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {2509#true} ~cond := #in~cond; {2509#true} is VALID [2022-04-07 13:03:45,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {2509#true} assume !(0 == ~cond); {2509#true} is VALID [2022-04-07 13:03:45,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {2509#true} assume true; {2509#true} is VALID [2022-04-07 13:03:45,086 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2509#true} {2509#true} #82#return; {2509#true} is VALID [2022-04-07 13:03:45,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {2509#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:45,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:45,087 INFO L290 TraceCheckUtils]: 13: Hoare triple {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:45,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2519#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:03:45,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {2519#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2519#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:03:45,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {2519#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !!(#t~post5 < 100);havoc #t~post5; {2519#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} is VALID [2022-04-07 13:03:45,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {2519#(and (= main_~p~0 0) (= main_~n~0 main_~r~0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2520#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:03:45,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {2520#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2520#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:03:45,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {2520#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {2520#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} is VALID [2022-04-07 13:03:45,092 INFO L272 TraceCheckUtils]: 20: Hoare triple {2520#(and (<= (+ (* (div (+ (* main_~p~0 2) main_~q~0) 4294967296) 4294967296) main_~r~0 1) (+ main_~q~0 (* (div main_~r~0 4294967296) 4294967296))) (= main_~p~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 13:03:45,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {2521#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2522#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 13:03:45,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {2522#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2510#false} is VALID [2022-04-07 13:03:45,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2022-04-07 13:03:45,093 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:45,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:03:45,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019390551] [2022-04-07 13:03:45,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019390551] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:03:45,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925949795] [2022-04-07 13:03:45,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:03:45,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:03:45,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:03:45,094 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:03:45,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 13:03:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:45,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-07 13:03:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:03:45,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:03:45,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {2509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #102#return; {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L272 TraceCheckUtils]: 4: Hoare triple {2509#true} call #t~ret7 := main(); {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {2509#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L272 TraceCheckUtils]: 6: Hoare triple {2509#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {2509#true} ~cond := #in~cond; {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {2509#true} assume !(0 == ~cond); {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {2509#true} assume true; {2509#true} is VALID [2022-04-07 13:03:45,406 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2509#true} {2509#true} #82#return; {2509#true} is VALID [2022-04-07 13:03:45,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {2509#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:45,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:45,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:45,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {2518#(and (= main_~p~0 0) (= (+ (- 1) main_~q~0) 0) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2569#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:45,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {2569#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2569#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:45,409 INFO L290 TraceCheckUtils]: 16: Hoare triple {2569#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {2569#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} is VALID [2022-04-07 13:03:45,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {2569#(and (= main_~p~0 0) (= main_~q~0 4) (= (+ main_~n~0 (* (- 1) main_~r~0)) 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2579#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:03:45,410 INFO L290 TraceCheckUtils]: 18: Hoare triple {2579#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2579#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:03:45,411 INFO L290 TraceCheckUtils]: 19: Hoare triple {2579#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} assume !!(#t~post6 < 100);havoc #t~post6; {2579#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} is VALID [2022-04-07 13:03:45,411 INFO L272 TraceCheckUtils]: 20: Hoare triple {2579#(and (not (<= (mod main_~q~0 4294967296) (mod main_~r~0 4294967296))) (= main_~p~0 0) (= main_~q~0 4))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:03:45,411 INFO L290 TraceCheckUtils]: 21: Hoare triple {2589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:03:45,412 INFO L290 TraceCheckUtils]: 22: Hoare triple {2593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2510#false} is VALID [2022-04-07 13:03:45,412 INFO L290 TraceCheckUtils]: 23: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2022-04-07 13:03:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:45,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:03:45,608 INFO L290 TraceCheckUtils]: 23: Hoare triple {2510#false} assume !false; {2510#false} is VALID [2022-04-07 13:03:45,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {2593#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2510#false} is VALID [2022-04-07 13:03:45,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {2589#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2593#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:03:45,610 INFO L272 TraceCheckUtils]: 20: Hoare triple {2609#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {2589#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:03:45,610 INFO L290 TraceCheckUtils]: 19: Hoare triple {2609#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} assume !!(#t~post6 < 100);havoc #t~post6; {2609#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:03:45,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {2609#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2609#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:03:45,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {2619#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {2609#(< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296))} is VALID [2022-04-07 13:03:45,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {2619#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} assume !!(#t~post5 < 100);havoc #t~post5; {2619#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:03:45,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {2619#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2619#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:03:45,623 INFO L290 TraceCheckUtils]: 14: Hoare triple {2629#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {2619#(or (<= (mod main_~q~0 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) main_~q~0) 4294967296)))} is VALID [2022-04-07 13:03:45,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {2629#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} assume !!(#t~post5 < 100);havoc #t~post5; {2629#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:03:45,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {2629#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2629#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:03:45,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {2509#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {2629#(or (<= (mod (* main_~q~0 4) 4294967296) (mod main_~n~0 4294967296)) (< (mod main_~r~0 4294967296) (mod (+ (* main_~p~0 2) (* main_~q~0 4)) 4294967296)))} is VALID [2022-04-07 13:03:45,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2509#true} {2509#true} #82#return; {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {2509#true} assume true; {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {2509#true} assume !(0 == ~cond); {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {2509#true} ~cond := #in~cond; {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {2509#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {2509#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {2509#true} call #t~ret7 := main(); {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2509#true} {2509#true} #102#return; {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {2509#true} assume true; {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {2509#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2509#true} is VALID [2022-04-07 13:03:45,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {2509#true} call ULTIMATE.init(); {2509#true} is VALID [2022-04-07 13:03:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:03:45,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925949795] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:03:45,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:03:45,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 15 [2022-04-07 13:03:45,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377971288] [2022-04-07 13:03:45,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:03:45,626 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 13:03:45,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:03:45,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:03:45,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:03:45,661 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 13:03:45,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:03:45,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 13:03:45,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-04-07 13:03:45,661 INFO L87 Difference]: Start difference. First operand 120 states and 173 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:03:50,626 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:52,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:54,629 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:56,631 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:03:58,789 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:00,791 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:07,037 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:09,462 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:11,508 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:15,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:04:29,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:34,277 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:41,356 INFO L93 Difference]: Finished difference Result 194 states and 284 transitions. [2022-04-07 13:04:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 13:04:41,356 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-04-07 13:04:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:04:41,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:04:41,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-07 13:04:41,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:04:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 144 transitions. [2022-04-07 13:04:41,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 144 transitions. [2022-04-07 13:04:42,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:42,329 INFO L225 Difference]: With dead ends: 194 [2022-04-07 13:04:42,329 INFO L226 Difference]: Without dead ends: 177 [2022-04-07 13:04:42,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2022-04-07 13:04:42,331 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 72 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 179 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.8s IncrementalHoareTripleChecker+Time [2022-04-07 13:04:42,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 162 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 499 Invalid, 11 Unknown, 0 Unchecked, 33.8s Time] [2022-04-07 13:04:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-07 13:04:42,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2022-04-07 13:04:42,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:04:42,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:04:42,421 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:04:42,421 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:04:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:42,426 INFO L93 Difference]: Finished difference Result 177 states and 253 transitions. [2022-04-07 13:04:42,426 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 253 transitions. [2022-04-07 13:04:42,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:42,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:42,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 177 states. [2022-04-07 13:04:42,428 INFO L87 Difference]: Start difference. First operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) Second operand 177 states. [2022-04-07 13:04:42,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:42,433 INFO L93 Difference]: Finished difference Result 177 states and 253 transitions. [2022-04-07 13:04:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 253 transitions. [2022-04-07 13:04:42,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:42,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:42,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:04:42,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:04:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 100 states have internal predecessors, (118), 65 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2022-04-07 13:04:42,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 240 transitions. [2022-04-07 13:04:42,439 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 240 transitions. Word has length 24 [2022-04-07 13:04:42,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:04:42,439 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 240 transitions. [2022-04-07 13:04:42,440 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 12 states have internal predecessors, (36), 4 states have call successors, (7), 4 states have call predecessors, (7), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:04:42,440 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 240 transitions. [2022-04-07 13:04:42,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 13:04:42,440 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:04:42,440 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:04:42,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 13:04:42,659 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:42,660 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:04:42,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:04:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash -45171523, now seen corresponding path program 1 times [2022-04-07 13:04:42,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:04:42,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043179367] [2022-04-07 13:04:42,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:42,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:04:42,668 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:04:42,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [98407135] [2022-04-07 13:04:42,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:42,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:42,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:04:42,687 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:04:42,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 13:04:42,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:42,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 13:04:42,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:42,785 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:04:42,941 INFO L272 TraceCheckUtils]: 0: Hoare triple {3592#true} call ULTIMATE.init(); {3592#true} is VALID [2022-04-07 13:04:42,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {3592#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3592#true} is VALID [2022-04-07 13:04:42,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-04-07 13:04:42,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3592#true} {3592#true} #102#return; {3592#true} is VALID [2022-04-07 13:04:42,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {3592#true} call #t~ret7 := main(); {3592#true} is VALID [2022-04-07 13:04:42,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {3592#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {3592#true} is VALID [2022-04-07 13:04:42,942 INFO L272 TraceCheckUtils]: 6: Hoare triple {3592#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {3592#true} is VALID [2022-04-07 13:04:42,942 INFO L290 TraceCheckUtils]: 7: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-04-07 13:04:42,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-04-07 13:04:42,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-04-07 13:04:42,942 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3592#true} {3592#true} #82#return; {3592#true} is VALID [2022-04-07 13:04:42,942 INFO L290 TraceCheckUtils]: 11: Hoare triple {3592#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:42,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:42,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:42,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:42,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:42,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:42,944 INFO L272 TraceCheckUtils]: 17: Hoare triple {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {3592#true} is VALID [2022-04-07 13:04:42,944 INFO L290 TraceCheckUtils]: 18: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-04-07 13:04:42,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-04-07 13:04:42,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-04-07 13:04:42,945 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3592#true} {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #84#return; {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:42,945 INFO L272 TraceCheckUtils]: 22: Hoare triple {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {3592#true} is VALID [2022-04-07 13:04:42,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {3592#true} ~cond := #in~cond; {3592#true} is VALID [2022-04-07 13:04:42,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {3592#true} assume !(0 == ~cond); {3592#true} is VALID [2022-04-07 13:04:42,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {3592#true} assume true; {3592#true} is VALID [2022-04-07 13:04:42,946 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {3592#true} {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} #86#return; {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} is VALID [2022-04-07 13:04:42,947 INFO L272 TraceCheckUtils]: 27: Hoare triple {3630#(and (= main_~p~0 0) (= main_~h~0 0) (= main_~q~0 1))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {3679#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:42,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {3679#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3683#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:42,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {3683#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3593#false} is VALID [2022-04-07 13:04:42,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {3593#false} assume !false; {3593#false} is VALID [2022-04-07 13:04:42,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 13:04:42,948 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:04:42,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:04:42,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043179367] [2022-04-07 13:04:42,948 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:04:42,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98407135] [2022-04-07 13:04:42,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98407135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:04:42,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:04:42,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:04:42,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76646888] [2022-04-07 13:04:42,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:04:42,949 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-07 13:04:42,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:04:42,949 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:42,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:42,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:04:42,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:04:42,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:04:42,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:04:42,976 INFO L87 Difference]: Start difference. First operand 170 states and 240 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:45,879 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:04:51,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:51,111 INFO L93 Difference]: Finished difference Result 176 states and 244 transitions. [2022-04-07 13:04:51,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:04:51,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 31 [2022-04-07 13:04:51,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:04:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:04:51,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:51,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 71 transitions. [2022-04-07 13:04:51,113 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 71 transitions. [2022-04-07 13:04:51,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:51,195 INFO L225 Difference]: With dead ends: 176 [2022-04-07 13:04:51,196 INFO L226 Difference]: Without dead ends: 152 [2022-04-07 13:04:51,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 13:04:51,196 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 6 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-07 13:04:51,197 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 154 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 1 Unknown, 0 Unchecked, 2.7s Time] [2022-04-07 13:04:51,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-07 13:04:51,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-04-07 13:04:51,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:04:51,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:04:51,254 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:04:51,257 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:04:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:51,262 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-07 13:04:51,262 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-07 13:04:51,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:51,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:51,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-07 13:04:51,264 INFO L87 Difference]: Start difference. First operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 152 states. [2022-04-07 13:04:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:51,270 INFO L93 Difference]: Finished difference Result 152 states and 216 transitions. [2022-04-07 13:04:51,270 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-07 13:04:51,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:51,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:51,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:04:51,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:04:51,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 83 states have (on average 1.2891566265060241) internal successors, (107), 90 states have internal predecessors, (107), 58 states have call successors, (58), 11 states have call predecessors, (58), 10 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:04:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2022-04-07 13:04:51,275 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 31 [2022-04-07 13:04:51,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:04:51,275 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2022-04-07 13:04:51,275 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:51,275 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2022-04-07 13:04:51,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 13:04:51,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:04:51,277 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:04:51,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 13:04:51,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:51,482 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:04:51,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:04:51,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1547125783, now seen corresponding path program 1 times [2022-04-07 13:04:51,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:04:51,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799474033] [2022-04-07 13:04:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:04:51,505 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:04:51,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1642988451] [2022-04-07 13:04:51,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:51,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:51,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:04:51,506 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:04:51,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 13:04:51,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:51,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 13:04:51,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:51,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:04:51,727 INFO L272 TraceCheckUtils]: 0: Hoare triple {4483#true} call ULTIMATE.init(); {4483#true} is VALID [2022-04-07 13:04:51,727 INFO L290 TraceCheckUtils]: 1: Hoare triple {4483#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4483#true} is VALID [2022-04-07 13:04:51,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-07 13:04:51,728 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4483#true} {4483#true} #102#return; {4483#true} is VALID [2022-04-07 13:04:51,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {4483#true} call #t~ret7 := main(); {4483#true} is VALID [2022-04-07 13:04:51,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {4483#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {4483#true} is VALID [2022-04-07 13:04:51,730 INFO L272 TraceCheckUtils]: 6: Hoare triple {4483#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {4483#true} is VALID [2022-04-07 13:04:51,730 INFO L290 TraceCheckUtils]: 7: Hoare triple {4483#true} ~cond := #in~cond; {4483#true} is VALID [2022-04-07 13:04:51,730 INFO L290 TraceCheckUtils]: 8: Hoare triple {4483#true} assume !(0 == ~cond); {4483#true} is VALID [2022-04-07 13:04:51,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-07 13:04:51,730 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4483#true} {4483#true} #82#return; {4483#true} is VALID [2022-04-07 13:04:51,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {4483#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} assume !(~q~0 % 4294967296 <= ~n~0 % 4294967296); {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,733 INFO L290 TraceCheckUtils]: 19: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,733 INFO L272 TraceCheckUtils]: 20: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {4483#true} is VALID [2022-04-07 13:04:51,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {4483#true} ~cond := #in~cond; {4483#true} is VALID [2022-04-07 13:04:51,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {4483#true} assume !(0 == ~cond); {4483#true} is VALID [2022-04-07 13:04:51,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-07 13:04:51,734 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {4483#true} {4521#(and (= main_~p~0 0) (= main_~h~0 0))} #84#return; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,734 INFO L272 TraceCheckUtils]: 25: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if (~p~0 * ~p~0 + ~r~0 * ~q~0) % 4294967296 == ~n~0 * ~q~0 % 4294967296 then 1 else 0)); {4483#true} is VALID [2022-04-07 13:04:51,734 INFO L290 TraceCheckUtils]: 26: Hoare triple {4483#true} ~cond := #in~cond; {4483#true} is VALID [2022-04-07 13:04:51,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {4483#true} assume !(0 == ~cond); {4483#true} is VALID [2022-04-07 13:04:51,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {4483#true} assume true; {4483#true} is VALID [2022-04-07 13:04:51,735 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {4483#true} {4521#(and (= main_~p~0 0) (= main_~h~0 0))} #86#return; {4521#(and (= main_~p~0 0) (= main_~h~0 0))} is VALID [2022-04-07 13:04:51,736 INFO L272 TraceCheckUtils]: 30: Hoare triple {4521#(and (= main_~p~0 0) (= main_~h~0 0))} call __VERIFIER_assert((if 0 == (~h~0 * ~h~0 * ~h~0 - 12 * ~h~0 * ~n~0 * ~q~0 + 16 * ~n~0 * ~p~0 * ~q~0 - ~h~0 * ~q~0 * ~q~0 - 4 * ~p~0 * ~q~0 * ~q~0 + 12 * ~h~0 * ~q~0 * ~r~0 - 16 * ~p~0 * ~q~0 * ~r~0) % 4294967296 then 1 else 0)); {4579#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 13:04:51,736 INFO L290 TraceCheckUtils]: 31: Hoare triple {4579#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4583#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 13:04:51,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {4583#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4484#false} is VALID [2022-04-07 13:04:51,737 INFO L290 TraceCheckUtils]: 33: Hoare triple {4484#false} assume !false; {4484#false} is VALID [2022-04-07 13:04:51,737 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 13:04:51,737 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:04:51,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:04:51,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799474033] [2022-04-07 13:04:51,737 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 13:04:51,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642988451] [2022-04-07 13:04:51,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642988451] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:04:51,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 13:04:51,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 13:04:51,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820240614] [2022-04-07 13:04:51,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:04:51,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 13:04:51,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:04:51,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:51,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:51,767 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:04:51,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:04:51,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:04:51,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 13:04:51,768 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:56,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:56,018 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2022-04-07 13:04:56,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:04:56,018 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 13:04:56,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:04:56,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:56,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:04:56,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:56,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 13:04:56,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 13:04:56,091 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:56,094 INFO L225 Difference]: With dead ends: 182 [2022-04-07 13:04:56,094 INFO L226 Difference]: Without dead ends: 177 [2022-04-07 13:04:56,095 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 13:04:56,095 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 8 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 13:04:56,095 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 156 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 13:04:56,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-07 13:04:56,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 170. [2022-04-07 13:04:56,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:04:56,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:04:56,154 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:04:56,155 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:04:56,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:56,159 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-07 13:04:56,159 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-07 13:04:56,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:56,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:56,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-07 13:04:56,160 INFO L87 Difference]: Start difference. First operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 177 states. [2022-04-07 13:04:56,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:04:56,165 INFO L93 Difference]: Finished difference Result 177 states and 228 transitions. [2022-04-07 13:04:56,165 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 228 transitions. [2022-04-07 13:04:56,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:04:56,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:04:56,165 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:04:56,165 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:04:56,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 101 states have internal predecessors, (113), 55 states have call successors, (55), 18 states have call predecessors, (55), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 13:04:56,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 219 transitions. [2022-04-07 13:04:56,169 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 219 transitions. Word has length 34 [2022-04-07 13:04:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:04:56,169 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 219 transitions. [2022-04-07 13:04:56,170 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 13:04:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 219 transitions. [2022-04-07 13:04:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 13:04:56,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:04:56,170 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:04:56,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 13:04:56,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:56,374 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:04:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:04:56,375 INFO L85 PathProgramCache]: Analyzing trace with hash 821435566, now seen corresponding path program 1 times [2022-04-07 13:04:56,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:04:56,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927897711] [2022-04-07 13:04:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:56,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:04:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:56,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:04:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:56,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {5472#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {5462#(<= ~counter~0 0)} assume true; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5462#(<= ~counter~0 0)} {5457#true} #102#return; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:04:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:56,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {5457#true} ~cond := #in~cond; {5457#true} is VALID [2022-04-07 13:04:56,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {5457#true} assume !(0 == ~cond); {5457#true} is VALID [2022-04-07 13:04:56,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {5457#true} assume true; {5457#true} is VALID [2022-04-07 13:04:56,518 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5457#true} {5462#(<= ~counter~0 0)} #82#return; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {5457#true} call ULTIMATE.init(); {5472#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:04:56,519 INFO L290 TraceCheckUtils]: 1: Hoare triple {5472#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,519 INFO L290 TraceCheckUtils]: 2: Hoare triple {5462#(<= ~counter~0 0)} assume true; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5462#(<= ~counter~0 0)} {5457#true} #102#return; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {5462#(<= ~counter~0 0)} call #t~ret7 := main(); {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,520 INFO L290 TraceCheckUtils]: 5: Hoare triple {5462#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,520 INFO L272 TraceCheckUtils]: 6: Hoare triple {5462#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5457#true} is VALID [2022-04-07 13:04:56,520 INFO L290 TraceCheckUtils]: 7: Hoare triple {5457#true} ~cond := #in~cond; {5457#true} is VALID [2022-04-07 13:04:56,520 INFO L290 TraceCheckUtils]: 8: Hoare triple {5457#true} assume !(0 == ~cond); {5457#true} is VALID [2022-04-07 13:04:56,520 INFO L290 TraceCheckUtils]: 9: Hoare triple {5457#true} assume true; {5457#true} is VALID [2022-04-07 13:04:56,520 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5457#true} {5462#(<= ~counter~0 0)} #82#return; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {5462#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {5462#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5467#(<= ~counter~0 1)} is VALID [2022-04-07 13:04:56,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {5467#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5467#(<= ~counter~0 1)} is VALID [2022-04-07 13:04:56,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {5467#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5467#(<= ~counter~0 1)} is VALID [2022-04-07 13:04:56,522 INFO L290 TraceCheckUtils]: 15: Hoare triple {5467#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5468#(<= ~counter~0 2)} is VALID [2022-04-07 13:04:56,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {5468#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5468#(<= ~counter~0 2)} is VALID [2022-04-07 13:04:56,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {5468#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5468#(<= ~counter~0 2)} is VALID [2022-04-07 13:04:56,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {5468#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5469#(<= ~counter~0 3)} is VALID [2022-04-07 13:04:56,523 INFO L290 TraceCheckUtils]: 19: Hoare triple {5469#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5469#(<= ~counter~0 3)} is VALID [2022-04-07 13:04:56,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {5469#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5469#(<= ~counter~0 3)} is VALID [2022-04-07 13:04:56,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {5469#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5470#(<= ~counter~0 4)} is VALID [2022-04-07 13:04:56,525 INFO L290 TraceCheckUtils]: 22: Hoare triple {5470#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5470#(<= ~counter~0 4)} is VALID [2022-04-07 13:04:56,525 INFO L290 TraceCheckUtils]: 23: Hoare triple {5470#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5470#(<= ~counter~0 4)} is VALID [2022-04-07 13:04:56,525 INFO L290 TraceCheckUtils]: 24: Hoare triple {5470#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5471#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:04:56,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {5471#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {5458#false} is VALID [2022-04-07 13:04:56,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {5458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5458#false} is VALID [2022-04-07 13:04:56,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {5458#false} assume !!(#t~post6 < 100);havoc #t~post6; {5458#false} is VALID [2022-04-07 13:04:56,526 INFO L272 TraceCheckUtils]: 28: Hoare triple {5458#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5458#false} is VALID [2022-04-07 13:04:56,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {5458#false} ~cond := #in~cond; {5458#false} is VALID [2022-04-07 13:04:56,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {5458#false} assume 0 == ~cond; {5458#false} is VALID [2022-04-07 13:04:56,527 INFO L290 TraceCheckUtils]: 31: Hoare triple {5458#false} assume !false; {5458#false} is VALID [2022-04-07 13:04:56,527 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:04:56,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:04:56,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927897711] [2022-04-07 13:04:56,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927897711] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:04:56,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342511152] [2022-04-07 13:04:56,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:04:56,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:04:56,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:04:56,528 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:04:56,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 13:04:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:56,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 13:04:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:04:56,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:04:56,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {5457#true} call ULTIMATE.init(); {5457#true} is VALID [2022-04-07 13:04:56,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {5457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,793 INFO L290 TraceCheckUtils]: 2: Hoare triple {5462#(<= ~counter~0 0)} assume true; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,793 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5462#(<= ~counter~0 0)} {5457#true} #102#return; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,794 INFO L272 TraceCheckUtils]: 4: Hoare triple {5462#(<= ~counter~0 0)} call #t~ret7 := main(); {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,794 INFO L290 TraceCheckUtils]: 5: Hoare triple {5462#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,794 INFO L272 TraceCheckUtils]: 6: Hoare triple {5462#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {5462#(<= ~counter~0 0)} ~cond := #in~cond; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {5462#(<= ~counter~0 0)} assume !(0 == ~cond); {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,795 INFO L290 TraceCheckUtils]: 9: Hoare triple {5462#(<= ~counter~0 0)} assume true; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,796 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5462#(<= ~counter~0 0)} {5462#(<= ~counter~0 0)} #82#return; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {5462#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5462#(<= ~counter~0 0)} is VALID [2022-04-07 13:04:56,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {5462#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5467#(<= ~counter~0 1)} is VALID [2022-04-07 13:04:56,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {5467#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5467#(<= ~counter~0 1)} is VALID [2022-04-07 13:04:56,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {5467#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5467#(<= ~counter~0 1)} is VALID [2022-04-07 13:04:56,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {5467#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5468#(<= ~counter~0 2)} is VALID [2022-04-07 13:04:56,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {5468#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5468#(<= ~counter~0 2)} is VALID [2022-04-07 13:04:56,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {5468#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5468#(<= ~counter~0 2)} is VALID [2022-04-07 13:04:56,799 INFO L290 TraceCheckUtils]: 18: Hoare triple {5468#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5469#(<= ~counter~0 3)} is VALID [2022-04-07 13:04:56,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {5469#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {5469#(<= ~counter~0 3)} is VALID [2022-04-07 13:04:56,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {5469#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5469#(<= ~counter~0 3)} is VALID [2022-04-07 13:04:56,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {5469#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5470#(<= ~counter~0 4)} is VALID [2022-04-07 13:04:56,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {5470#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {5470#(<= ~counter~0 4)} is VALID [2022-04-07 13:04:56,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {5470#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5470#(<= ~counter~0 4)} is VALID [2022-04-07 13:04:56,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {5470#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5471#(<= |main_#t~post5| 4)} is VALID [2022-04-07 13:04:56,801 INFO L290 TraceCheckUtils]: 25: Hoare triple {5471#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {5458#false} is VALID [2022-04-07 13:04:56,801 INFO L290 TraceCheckUtils]: 26: Hoare triple {5458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5458#false} is VALID [2022-04-07 13:04:56,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {5458#false} assume !!(#t~post6 < 100);havoc #t~post6; {5458#false} is VALID [2022-04-07 13:04:56,801 INFO L272 TraceCheckUtils]: 28: Hoare triple {5458#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5458#false} is VALID [2022-04-07 13:04:56,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {5458#false} ~cond := #in~cond; {5458#false} is VALID [2022-04-07 13:04:56,801 INFO L290 TraceCheckUtils]: 30: Hoare triple {5458#false} assume 0 == ~cond; {5458#false} is VALID [2022-04-07 13:04:56,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {5458#false} assume !false; {5458#false} is VALID [2022-04-07 13:04:56,802 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:04:56,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 13:04:57,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {5458#false} assume !false; {5458#false} is VALID [2022-04-07 13:04:57,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {5458#false} assume 0 == ~cond; {5458#false} is VALID [2022-04-07 13:04:57,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {5458#false} ~cond := #in~cond; {5458#false} is VALID [2022-04-07 13:04:57,079 INFO L272 TraceCheckUtils]: 28: Hoare triple {5458#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {5458#false} is VALID [2022-04-07 13:04:57,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {5458#false} assume !!(#t~post6 < 100);havoc #t~post6; {5458#false} is VALID [2022-04-07 13:04:57,079 INFO L290 TraceCheckUtils]: 26: Hoare triple {5458#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5458#false} is VALID [2022-04-07 13:04:57,079 INFO L290 TraceCheckUtils]: 25: Hoare triple {5587#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {5458#false} is VALID [2022-04-07 13:04:57,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {5591#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5587#(< |main_#t~post5| 100)} is VALID [2022-04-07 13:04:57,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {5591#(< ~counter~0 100)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5591#(< ~counter~0 100)} is VALID [2022-04-07 13:04:57,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {5591#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {5591#(< ~counter~0 100)} is VALID [2022-04-07 13:04:57,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {5601#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5591#(< ~counter~0 100)} is VALID [2022-04-07 13:04:57,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {5601#(< ~counter~0 99)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5601#(< ~counter~0 99)} is VALID [2022-04-07 13:04:57,081 INFO L290 TraceCheckUtils]: 19: Hoare triple {5601#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {5601#(< ~counter~0 99)} is VALID [2022-04-07 13:04:57,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {5611#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5601#(< ~counter~0 99)} is VALID [2022-04-07 13:04:57,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {5611#(< ~counter~0 98)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5611#(< ~counter~0 98)} is VALID [2022-04-07 13:04:57,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {5611#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {5611#(< ~counter~0 98)} is VALID [2022-04-07 13:04:57,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {5621#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5611#(< ~counter~0 98)} is VALID [2022-04-07 13:04:57,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {5621#(< ~counter~0 97)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {5621#(< ~counter~0 97)} is VALID [2022-04-07 13:04:57,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {5621#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {5621#(< ~counter~0 97)} is VALID [2022-04-07 13:04:57,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {5631#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5621#(< ~counter~0 97)} is VALID [2022-04-07 13:04:57,084 INFO L290 TraceCheckUtils]: 11: Hoare triple {5631#(< ~counter~0 96)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {5631#(< ~counter~0 96)} is VALID [2022-04-07 13:04:57,085 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5457#true} {5631#(< ~counter~0 96)} #82#return; {5631#(< ~counter~0 96)} is VALID [2022-04-07 13:04:57,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {5457#true} assume true; {5457#true} is VALID [2022-04-07 13:04:57,085 INFO L290 TraceCheckUtils]: 8: Hoare triple {5457#true} assume !(0 == ~cond); {5457#true} is VALID [2022-04-07 13:04:57,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {5457#true} ~cond := #in~cond; {5457#true} is VALID [2022-04-07 13:04:57,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {5631#(< ~counter~0 96)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {5457#true} is VALID [2022-04-07 13:04:57,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {5631#(< ~counter~0 96)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {5631#(< ~counter~0 96)} is VALID [2022-04-07 13:04:57,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {5631#(< ~counter~0 96)} call #t~ret7 := main(); {5631#(< ~counter~0 96)} is VALID [2022-04-07 13:04:57,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5631#(< ~counter~0 96)} {5457#true} #102#return; {5631#(< ~counter~0 96)} is VALID [2022-04-07 13:04:57,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {5631#(< ~counter~0 96)} assume true; {5631#(< ~counter~0 96)} is VALID [2022-04-07 13:04:57,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {5457#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5631#(< ~counter~0 96)} is VALID [2022-04-07 13:04:57,087 INFO L272 TraceCheckUtils]: 0: Hoare triple {5457#true} call ULTIMATE.init(); {5457#true} is VALID [2022-04-07 13:04:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:04:57,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342511152] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 13:04:57,087 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-07 13:04:57,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 15 [2022-04-07 13:04:57,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835245691] [2022-04-07 13:04:57,087 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-07 13:04:57,088 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-07 13:04:57,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:04:57,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:04:57,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:04:57,131 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-07 13:04:57,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:04:57,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-07 13:04:57,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2022-04-07 13:04:57,131 INFO L87 Difference]: Start difference. First operand 170 states and 219 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:05:02,148 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:05:04,312 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:12,719 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:14,725 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:17,242 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:19,244 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:21,249 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:29,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 7.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:35,820 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:42,559 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:49,283 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.72s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:56,019 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 6.74s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:05:58,490 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:00,498 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:04,603 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:07,053 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:06:12,962 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:14,997 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:18,982 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:21,521 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:23,526 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:26,467 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:31,892 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:35,942 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:38,512 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:06:40,516 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:06:42,519 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-07 13:06:45,023 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-07 13:06:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:47,973 INFO L93 Difference]: Finished difference Result 350 states and 446 transitions. [2022-04-07 13:06:47,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-07 13:06:47,973 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2022-04-07 13:06:47,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:47,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:06:47,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 241 transitions. [2022-04-07 13:06:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:06:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 241 transitions. [2022-04-07 13:06:47,978 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 241 transitions. [2022-04-07 13:06:48,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:48,221 INFO L225 Difference]: With dead ends: 350 [2022-04-07 13:06:48,221 INFO L226 Difference]: Without dead ends: 310 [2022-04-07 13:06:48,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=716, Unknown=0, NotChecked=0, Total=992 [2022-04-07 13:06:48,222 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 162 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 421 mSolverCounterSat, 96 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 421 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 99.6s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:48,222 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 204 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 421 Invalid, 26 Unknown, 0 Unchecked, 99.6s Time] [2022-04-07 13:06:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-07 13:06:48,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 279. [2022-04-07 13:06:48,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:48,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 279 states, 165 states have (on average 1.1757575757575758) internal successors, (194), 173 states have internal predecessors, (194), 84 states have call successors, (84), 30 states have call predecessors, (84), 29 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-07 13:06:48,319 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 279 states, 165 states have (on average 1.1757575757575758) internal successors, (194), 173 states have internal predecessors, (194), 84 states have call successors, (84), 30 states have call predecessors, (84), 29 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-07 13:06:48,320 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 279 states, 165 states have (on average 1.1757575757575758) internal successors, (194), 173 states have internal predecessors, (194), 84 states have call successors, (84), 30 states have call predecessors, (84), 29 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-07 13:06:48,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:48,326 INFO L93 Difference]: Finished difference Result 310 states and 387 transitions. [2022-04-07 13:06:48,326 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 387 transitions. [2022-04-07 13:06:48,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:48,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:48,328 INFO L74 IsIncluded]: Start isIncluded. First operand has 279 states, 165 states have (on average 1.1757575757575758) internal successors, (194), 173 states have internal predecessors, (194), 84 states have call successors, (84), 30 states have call predecessors, (84), 29 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) Second operand 310 states. [2022-04-07 13:06:48,328 INFO L87 Difference]: Start difference. First operand has 279 states, 165 states have (on average 1.1757575757575758) internal successors, (194), 173 states have internal predecessors, (194), 84 states have call successors, (84), 30 states have call predecessors, (84), 29 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) Second operand 310 states. [2022-04-07 13:06:48,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:48,334 INFO L93 Difference]: Finished difference Result 310 states and 387 transitions. [2022-04-07 13:06:48,334 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 387 transitions. [2022-04-07 13:06:48,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:48,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:48,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:48,335 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:48,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 165 states have (on average 1.1757575757575758) internal successors, (194), 173 states have internal predecessors, (194), 84 states have call successors, (84), 30 states have call predecessors, (84), 29 states have return successors, (79), 75 states have call predecessors, (79), 79 states have call successors, (79) [2022-04-07 13:06:48,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 357 transitions. [2022-04-07 13:06:48,342 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 357 transitions. Word has length 32 [2022-04-07 13:06:48,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:48,342 INFO L478 AbstractCegarLoop]: Abstraction has 279 states and 357 transitions. [2022-04-07 13:06:48,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 14 states have internal predecessors, (48), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 13:06:48,342 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 357 transitions. [2022-04-07 13:06:48,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-07 13:06:48,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:48,343 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:06:48,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 13:06:48,559 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 13:06:48,561 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:48,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:48,562 INFO L85 PathProgramCache]: Analyzing trace with hash -271152338, now seen corresponding path program 2 times [2022-04-07 13:06:48,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:48,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424005811] [2022-04-07 13:06:48,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:48,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:48,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 13:06:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:48,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {7254#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {7238#(<= ~counter~0 0)} assume true; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,747 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7238#(<= ~counter~0 0)} {7233#true} #102#return; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 13:06:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:48,752 INFO L290 TraceCheckUtils]: 0: Hoare triple {7233#true} ~cond := #in~cond; {7233#true} is VALID [2022-04-07 13:06:48,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {7233#true} assume !(0 == ~cond); {7233#true} is VALID [2022-04-07 13:06:48,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {7233#true} assume true; {7233#true} is VALID [2022-04-07 13:06:48,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7233#true} {7238#(<= ~counter~0 0)} #82#return; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,753 INFO L272 TraceCheckUtils]: 0: Hoare triple {7233#true} call ULTIMATE.init(); {7254#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 13:06:48,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {7254#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {7238#(<= ~counter~0 0)} assume true; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7238#(<= ~counter~0 0)} {7233#true} #102#return; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,755 INFO L272 TraceCheckUtils]: 4: Hoare triple {7238#(<= ~counter~0 0)} call #t~ret7 := main(); {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {7238#(<= ~counter~0 0)} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,755 INFO L272 TraceCheckUtils]: 6: Hoare triple {7238#(<= ~counter~0 0)} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7233#true} is VALID [2022-04-07 13:06:48,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {7233#true} ~cond := #in~cond; {7233#true} is VALID [2022-04-07 13:06:48,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {7233#true} assume !(0 == ~cond); {7233#true} is VALID [2022-04-07 13:06:48,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {7233#true} assume true; {7233#true} is VALID [2022-04-07 13:06:48,755 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7233#true} {7238#(<= ~counter~0 0)} #82#return; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {7238#(<= ~counter~0 0)} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7238#(<= ~counter~0 0)} is VALID [2022-04-07 13:06:48,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {7238#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7243#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:48,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {7243#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {7243#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:48,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {7243#(<= ~counter~0 1)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7243#(<= ~counter~0 1)} is VALID [2022-04-07 13:06:48,757 INFO L290 TraceCheckUtils]: 15: Hoare triple {7243#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7244#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:48,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {7244#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {7244#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:48,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {7244#(<= ~counter~0 2)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7244#(<= ~counter~0 2)} is VALID [2022-04-07 13:06:48,758 INFO L290 TraceCheckUtils]: 18: Hoare triple {7244#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7245#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:48,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {7245#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {7245#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:48,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {7245#(<= ~counter~0 3)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7245#(<= ~counter~0 3)} is VALID [2022-04-07 13:06:48,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {7245#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7246#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:48,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {7246#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {7246#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:48,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {7246#(<= ~counter~0 4)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7246#(<= ~counter~0 4)} is VALID [2022-04-07 13:06:48,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {7246#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7247#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:48,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {7247#(<= ~counter~0 5)} assume !!(#t~post5 < 100);havoc #t~post5; {7247#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:48,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {7247#(<= ~counter~0 5)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7247#(<= ~counter~0 5)} is VALID [2022-04-07 13:06:48,762 INFO L290 TraceCheckUtils]: 27: Hoare triple {7247#(<= ~counter~0 5)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7248#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:48,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {7248#(<= ~counter~0 6)} assume !!(#t~post5 < 100);havoc #t~post5; {7248#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:48,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {7248#(<= ~counter~0 6)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7248#(<= ~counter~0 6)} is VALID [2022-04-07 13:06:48,763 INFO L290 TraceCheckUtils]: 30: Hoare triple {7248#(<= ~counter~0 6)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7249#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:48,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {7249#(<= ~counter~0 7)} assume !!(#t~post5 < 100);havoc #t~post5; {7249#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:48,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {7249#(<= ~counter~0 7)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7249#(<= ~counter~0 7)} is VALID [2022-04-07 13:06:48,764 INFO L290 TraceCheckUtils]: 33: Hoare triple {7249#(<= ~counter~0 7)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7250#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:48,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {7250#(<= ~counter~0 8)} assume !!(#t~post5 < 100);havoc #t~post5; {7250#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:48,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {7250#(<= ~counter~0 8)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7250#(<= ~counter~0 8)} is VALID [2022-04-07 13:06:48,765 INFO L290 TraceCheckUtils]: 36: Hoare triple {7250#(<= ~counter~0 8)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7251#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:48,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {7251#(<= ~counter~0 9)} assume !!(#t~post5 < 100);havoc #t~post5; {7251#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:48,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {7251#(<= ~counter~0 9)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7251#(<= ~counter~0 9)} is VALID [2022-04-07 13:06:48,766 INFO L290 TraceCheckUtils]: 39: Hoare triple {7251#(<= ~counter~0 9)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7252#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:48,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {7252#(<= ~counter~0 10)} assume !!(#t~post5 < 100);havoc #t~post5; {7252#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:48,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {7252#(<= ~counter~0 10)} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7252#(<= ~counter~0 10)} is VALID [2022-04-07 13:06:48,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {7252#(<= ~counter~0 10)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7253#(<= |main_#t~post5| 10)} is VALID [2022-04-07 13:06:48,767 INFO L290 TraceCheckUtils]: 43: Hoare triple {7253#(<= |main_#t~post5| 10)} assume !(#t~post5 < 100);havoc #t~post5; {7234#false} is VALID [2022-04-07 13:06:48,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {7234#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7234#false} is VALID [2022-04-07 13:06:48,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {7234#false} assume !!(#t~post6 < 100);havoc #t~post6; {7234#false} is VALID [2022-04-07 13:06:48,767 INFO L272 TraceCheckUtils]: 46: Hoare triple {7234#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7234#false} is VALID [2022-04-07 13:06:48,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {7234#false} ~cond := #in~cond; {7234#false} is VALID [2022-04-07 13:06:48,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {7234#false} assume 0 == ~cond; {7234#false} is VALID [2022-04-07 13:06:48,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {7234#false} assume !false; {7234#false} is VALID [2022-04-07 13:06:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-07 13:06:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 13:06:48,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424005811] [2022-04-07 13:06:48,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424005811] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 13:06:48,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493108149] [2022-04-07 13:06:48,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 13:06:48,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:48,769 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:06:48,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 13:06:48,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-07 13:06:48,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 13:06:48,807 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-07 13:06:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 13:06:48,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 13:06:48,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {7233#true} call ULTIMATE.init(); {7233#true} is VALID [2022-04-07 13:06:48,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {7233#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {7233#true} assume true; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7233#true} {7233#true} #102#return; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {7233#true} call #t~ret7 := main(); {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {7233#true} havoc ~n~0;havoc ~p~0;havoc ~q~0;havoc ~r~0;havoc ~h~0;~n~0 := #t~nondet4;havoc #t~nondet4; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L272 TraceCheckUtils]: 6: Hoare triple {7233#true} call assume_abort_if_not((if ~n~0 % 4294967296 < 1073741823 then 1 else 0)); {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {7233#true} ~cond := #in~cond; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 8: Hoare triple {7233#true} assume !(0 == ~cond); {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 9: Hoare triple {7233#true} assume true; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7233#true} {7233#true} #82#return; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {7233#true} ~p~0 := 0;~q~0 := 1;~r~0 := ~n~0;~h~0 := 0; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 14: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 25: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 27: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 31: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 33: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 34: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 35: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 36: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,977 INFO L290 TraceCheckUtils]: 39: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,978 INFO L290 TraceCheckUtils]: 40: Hoare triple {7233#true} assume !!(#t~post5 < 100);havoc #t~post5; {7233#true} is VALID [2022-04-07 13:06:48,978 INFO L290 TraceCheckUtils]: 41: Hoare triple {7233#true} assume !!(~q~0 % 4294967296 <= ~n~0 % 4294967296);~q~0 := 4 * ~q~0; {7233#true} is VALID [2022-04-07 13:06:48,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {7233#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7384#(<= (+ |main_#t~post5| 1) ~counter~0)} is VALID [2022-04-07 13:06:48,980 INFO L290 TraceCheckUtils]: 43: Hoare triple {7384#(<= (+ |main_#t~post5| 1) ~counter~0)} assume !(#t~post5 < 100);havoc #t~post5; {7388#(<= 101 ~counter~0)} is VALID [2022-04-07 13:06:48,981 INFO L290 TraceCheckUtils]: 44: Hoare triple {7388#(<= 101 ~counter~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7392#(<= 101 |main_#t~post6|)} is VALID [2022-04-07 13:06:48,981 INFO L290 TraceCheckUtils]: 45: Hoare triple {7392#(<= 101 |main_#t~post6|)} assume !!(#t~post6 < 100);havoc #t~post6; {7234#false} is VALID [2022-04-07 13:06:48,981 INFO L272 TraceCheckUtils]: 46: Hoare triple {7234#false} call __VERIFIER_assert((if ~r~0 % 4294967296 < (2 * ~p~0 + ~q~0) % 4294967296 then 1 else 0)); {7234#false} is VALID [2022-04-07 13:06:48,981 INFO L290 TraceCheckUtils]: 47: Hoare triple {7234#false} ~cond := #in~cond; {7234#false} is VALID [2022-04-07 13:06:48,981 INFO L290 TraceCheckUtils]: 48: Hoare triple {7234#false} assume 0 == ~cond; {7234#false} is VALID [2022-04-07 13:06:48,981 INFO L290 TraceCheckUtils]: 49: Hoare triple {7234#false} assume !false; {7234#false} is VALID [2022-04-07 13:06:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2022-04-07 13:06:48,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 13:06:48,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493108149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 13:06:48,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 13:06:48,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 18 [2022-04-07 13:06:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799060656] [2022-04-07 13:06:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 13:06:48,982 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-07 13:06:48,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 13:06:48,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:48,998 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:48,999 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 13:06:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 13:06:48,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 13:06:48,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2022-04-07 13:06:48,999 INFO L87 Difference]: Start difference. First operand 279 states and 357 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:52,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:52,551 INFO L93 Difference]: Finished difference Result 316 states and 406 transitions. [2022-04-07 13:06:52,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 13:06:52,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 50 [2022-04-07 13:06:52,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 13:06:52,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 13:06:52,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:52,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-07 13:06:52,553 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-07 13:06:52,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 13:06:52,634 INFO L225 Difference]: With dead ends: 316 [2022-04-07 13:06:52,634 INFO L226 Difference]: Without dead ends: 276 [2022-04-07 13:06:52,635 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-04-07 13:06:52,635 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 13:06:52,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 167 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 13:06:52,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2022-04-07 13:06:52,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 271. [2022-04-07 13:06:52,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 13:06:52,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 276 states. Second operand has 271 states, 158 states have (on average 1.1708860759493671) internal successors, (185), 165 states have internal predecessors, (185), 83 states have call successors, (83), 30 states have call predecessors, (83), 29 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-07 13:06:52,750 INFO L74 IsIncluded]: Start isIncluded. First operand 276 states. Second operand has 271 states, 158 states have (on average 1.1708860759493671) internal successors, (185), 165 states have internal predecessors, (185), 83 states have call successors, (83), 30 states have call predecessors, (83), 29 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-07 13:06:52,750 INFO L87 Difference]: Start difference. First operand 276 states. Second operand has 271 states, 158 states have (on average 1.1708860759493671) internal successors, (185), 165 states have internal predecessors, (185), 83 states have call successors, (83), 30 states have call predecessors, (83), 29 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-07 13:06:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:52,755 INFO L93 Difference]: Finished difference Result 276 states and 352 transitions. [2022-04-07 13:06:52,756 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 352 transitions. [2022-04-07 13:06:52,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:52,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:52,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 158 states have (on average 1.1708860759493671) internal successors, (185), 165 states have internal predecessors, (185), 83 states have call successors, (83), 30 states have call predecessors, (83), 29 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) Second operand 276 states. [2022-04-07 13:06:52,757 INFO L87 Difference]: Start difference. First operand has 271 states, 158 states have (on average 1.1708860759493671) internal successors, (185), 165 states have internal predecessors, (185), 83 states have call successors, (83), 30 states have call predecessors, (83), 29 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) Second operand 276 states. [2022-04-07 13:06:52,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 13:06:52,763 INFO L93 Difference]: Finished difference Result 276 states and 352 transitions. [2022-04-07 13:06:52,763 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 352 transitions. [2022-04-07 13:06:52,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 13:06:52,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 13:06:52,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 13:06:52,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 13:06:52,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 158 states have (on average 1.1708860759493671) internal successors, (185), 165 states have internal predecessors, (185), 83 states have call successors, (83), 30 states have call predecessors, (83), 29 states have return successors, (78), 75 states have call predecessors, (78), 78 states have call successors, (78) [2022-04-07 13:06:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 346 transitions. [2022-04-07 13:06:52,770 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 346 transitions. Word has length 50 [2022-04-07 13:06:52,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 13:06:52,770 INFO L478 AbstractCegarLoop]: Abstraction has 271 states and 346 transitions. [2022-04-07 13:06:52,770 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-07 13:06:52,770 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 346 transitions. [2022-04-07 13:06:52,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-07 13:06:52,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 13:06:52,772 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 13:06:52,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 13:06:52,988 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:52,989 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 13:06:52,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 13:06:52,989 INFO L85 PathProgramCache]: Analyzing trace with hash 109392637, now seen corresponding path program 1 times [2022-04-07 13:06:52,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 13:06:52,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474870120] [2022-04-07 13:06:52,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:52,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 13:06:52,999 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 13:06:52,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [242235701] [2022-04-07 13:06:52,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 13:06:52,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 13:06:52,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 13:06:53,000 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 13:06:53,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process