/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:40:23,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:40:23,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:40:23,485 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:40:23,486 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:40:23,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:40:23,488 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:40:23,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:40:23,491 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:40:23,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:40:23,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:40:23,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:40:23,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:40:23,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:40:23,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:40:23,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:40:23,496 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:40:23,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:40:23,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:40:23,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:40:23,501 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:40:23,506 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:40:23,509 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:40:23,511 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:40:23,512 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:40:23,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:40:23,519 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:40:23,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:40:23,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:40:23,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:40:23,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:40:23,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:40:23,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:40:23,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:40:23,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:40:23,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:40:23,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:40:23,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:40:23,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:40:23,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:40:23,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:40:23,532 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:40:23,533 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 06:40:23,543 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:40:23,543 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:40:23,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:40:23,544 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:40:23,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:40:23,545 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:40:23,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:40:23,545 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:40:23,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:40:23,545 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:40:23,545 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:40:23,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:40:23,545 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:40:23,546 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:40:23,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:40:23,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:40:23,546 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:40:23,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:40:23,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:40:23,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:40:23,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:40:23,546 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:40:23,547 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:40:23,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:40:23,547 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:40:23,547 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 06:40:23,780 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:40:23,804 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:40:23,806 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:40:23,807 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:40:23,808 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:40:23,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-15 06:40:23,867 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3c8c68d/f3f9ba8994b4465eafe0cdaed072c722/FLAGb248aca36 [2022-04-15 06:40:24,243 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:40:24,244 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c [2022-04-15 06:40:24,249 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3c8c68d/f3f9ba8994b4465eafe0cdaed072c722/FLAGb248aca36 [2022-04-15 06:40:24,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca3c8c68d/f3f9ba8994b4465eafe0cdaed072c722 [2022-04-15 06:40:24,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:40:24,264 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:40:24,266 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:40:24,266 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:40:24,269 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:40:24,270 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,271 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63c868b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24, skipping insertion in model container [2022-04-15 06:40:24,271 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,276 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:40:24,286 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:40:24,447 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c[368,381] [2022-04-15 06:40:24,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:40:24,482 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:40:24,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de51.c[368,381] [2022-04-15 06:40:24,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:40:24,518 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:40:24,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24 WrapperNode [2022-04-15 06:40:24,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:40:24,520 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:40:24,520 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:40:24,521 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:40:24,530 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,538 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,545 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,556 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,560 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:40:24,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:40:24,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:40:24,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:40:24,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24" (1/1) ... [2022-04-15 06:40:24,570 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:40:24,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:24,592 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-15 06:40:24,619 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-15 06:40:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:40:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:40:24,645 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:40:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:40:24,646 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:40:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:40:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:40:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:40:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:40:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:40:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:40:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:40:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:40:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:40:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:40:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:40:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:40:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:40:24,700 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:40:24,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:40:24,924 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:40:24,929 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:40:24,929 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-15 06:40:24,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:40:24 BoogieIcfgContainer [2022-04-15 06:40:24,931 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:40:24,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:40:24,932 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:40:24,935 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:40:24,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:40:24" (1/3) ... [2022-04-15 06:40:24,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a4e75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:40:24, skipping insertion in model container [2022-04-15 06:40:24,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:40:24" (2/3) ... [2022-04-15 06:40:24,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39a4e75f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:40:24, skipping insertion in model container [2022-04-15 06:40:24,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:40:24" (3/3) ... [2022-04-15 06:40:24,937 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de51.c [2022-04-15 06:40:24,940 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:40:24,940 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:40:24,973 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:40:24,978 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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-15 06:40:24,978 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:40:24,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 06:40:25,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:40:25,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:25,004 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:25,004 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:25,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 1 times [2022-04-15 06:40:25,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:25,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [591263100] [2022-04-15 06:40:25,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:40:25,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1060076674, now seen corresponding path program 2 times [2022-04-15 06:40:25,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:25,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46505763] [2022-04-15 06:40:25,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:25,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:25,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:25,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:25,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 06:40:25,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 06:40:25,186 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-15 06:40:25,188 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:25,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-15 06:40:25,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 06:40:25,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #83#return; {27#true} is VALID [2022-04-15 06:40:25,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret15 := main(); {27#true} is VALID [2022-04-15 06:40:25,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {27#true} is VALID [2022-04-15 06:40:25,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !(~x~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 06:40:25,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#true} ~z~0 := ~y~0; {27#true} is VALID [2022-04-15 06:40:25,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#true} assume !(~z~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 06:40:25,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#true} assume !(~y~0 % 4294967296 > 0); {27#true} is VALID [2022-04-15 06:40:25,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 06:40:25,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !(~z~0 % 4294967296 > 0); {28#false} is VALID [2022-04-15 06:40:25,191 INFO L272 TraceCheckUtils]: 12: Hoare triple {28#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {28#false} is VALID [2022-04-15 06:40:25,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 06:40:25,192 INFO L290 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 06:40:25,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 06:40:25,192 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-15 06:40:25,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:25,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46505763] [2022-04-15 06:40:25,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46505763] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:25,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:25,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:40:25,195 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:25,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [591263100] [2022-04-15 06:40:25,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [591263100] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:25,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:25,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 06:40:25,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161257888] [2022-04-15 06:40:25,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:25,199 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:40:25,200 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:25,202 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:25,224 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 06:40:25,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 06:40:25,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 06:40:25,239 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.75) internal successors, (28), 17 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:25,317 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2022-04-15 06:40:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 06:40:25,317 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:40:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:25,318 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 06:40:25,324 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2022-04-15 06:40:25,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 60 transitions. [2022-04-15 06:40:25,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:25,390 INFO L225 Difference]: With dead ends: 41 [2022-04-15 06:40:25,390 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:40:25,392 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-15 06:40:25,394 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 19 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:25,395 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 30 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:40:25,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:40:25,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:25,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,429 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,429 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:25,431 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-15 06:40:25,431 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 06:40:25,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:25,431 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:25,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:40:25,432 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-15 06:40:25,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:25,433 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2022-04-15 06:40:25,433 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 06:40:25,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:25,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:25,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:25,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:25,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-04-15 06:40:25,451 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 16 [2022-04-15 06:40:25,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:25,451 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-04-15 06:40:25,452 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, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 21 transitions. [2022-04-15 06:40:25,470 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-15 06:40:25,470 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-04-15 06:40:25,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 06:40:25,470 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:25,470 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:25,470 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:40:25,471 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:25,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:25,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 1 times [2022-04-15 06:40:25,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:25,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1132680476] [2022-04-15 06:40:25,472 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:40:25,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1174593278, now seen corresponding path program 2 times [2022-04-15 06:40:25,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:25,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874588825] [2022-04-15 06:40:25,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:25,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:25,630 INFO L290 TraceCheckUtils]: 0: Hoare triple {193#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-15 06:40:25,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-15 06:40:25,630 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-15 06:40:25,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {185#true} call ULTIMATE.init(); {193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:25,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {193#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {185#true} is VALID [2022-04-15 06:40:25,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {185#true} assume true; {185#true} is VALID [2022-04-15 06:40:25,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185#true} {185#true} #83#return; {185#true} is VALID [2022-04-15 06:40:25,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {185#true} call #t~ret15 := main(); {185#true} is VALID [2022-04-15 06:40:25,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:25,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:25,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:25,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:25,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~y~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:25,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:25,635 INFO L290 TraceCheckUtils]: 11: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:25,635 INFO L272 TraceCheckUtils]: 12: Hoare triple {190#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {191#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:25,636 INFO L290 TraceCheckUtils]: 13: Hoare triple {191#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {192#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:25,636 INFO L290 TraceCheckUtils]: 14: Hoare triple {192#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {186#false} is VALID [2022-04-15 06:40:25,636 INFO L290 TraceCheckUtils]: 15: Hoare triple {186#false} assume !false; {186#false} is VALID [2022-04-15 06:40:25,637 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-15 06:40:25,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:25,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874588825] [2022-04-15 06:40:25,637 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874588825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:25,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:25,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:25,637 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:25,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1132680476] [2022-04-15 06:40:25,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1132680476] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:25,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:25,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:25,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790160704] [2022-04-15 06:40:25,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:25,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:40:25,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:25,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:25,651 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:25,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:25,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:25,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:40:25,652 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:25,794 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-04-15 06:40:25,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:40:25,794 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 06:40:25,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 06:40:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2022-04-15 06:40:25,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 36 transitions. [2022-04-15 06:40:25,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:25,833 INFO L225 Difference]: With dead ends: 28 [2022-04-15 06:40:25,834 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:40:25,834 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:40:25,836 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:25,837 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 31 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:25,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:40:25,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-15 06:40:25,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:25,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,851 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,851 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:25,853 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-15 06:40:25,853 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 06:40:25,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:25,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:25,854 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:40:25,855 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:40:25,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:25,857 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2022-04-15 06:40:25,857 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 06:40:25,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:25,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:25,858 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:25,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:25,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.5) internal successors, (27), 18 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-04-15 06:40:25,860 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 16 [2022-04-15 06:40:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:25,861 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-04-15 06:40:25,862 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 31 transitions. [2022-04-15 06:40:25,885 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:25,885 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-04-15 06:40:25,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:40:25,886 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:25,886 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:25,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:40:25,887 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:25,888 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 1 times [2022-04-15 06:40:25,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:25,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1306579244] [2022-04-15 06:40:25,891 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:40:25,891 INFO L85 PathProgramCache]: Analyzing trace with hash -2018158143, now seen corresponding path program 2 times [2022-04-15 06:40:25,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:25,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842516021] [2022-04-15 06:40:25,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:25,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:25,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:25,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:25,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {356#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-15 06:40:25,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-15 06:40:25,954 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-15 06:40:25,957 INFO L272 TraceCheckUtils]: 0: Hoare triple {350#true} call ULTIMATE.init(); {356#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:25,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {356#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {350#true} is VALID [2022-04-15 06:40:25,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {350#true} assume true; {350#true} is VALID [2022-04-15 06:40:25,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {350#true} {350#true} #83#return; {350#true} is VALID [2022-04-15 06:40:25,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {350#true} call #t~ret15 := main(); {350#true} is VALID [2022-04-15 06:40:25,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {350#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {350#true} is VALID [2022-04-15 06:40:25,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#true} assume !(~x~0 % 4294967296 > 0); {350#true} is VALID [2022-04-15 06:40:25,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#true} ~z~0 := ~y~0; {350#true} is VALID [2022-04-15 06:40:25,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#true} assume !(~z~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:25,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~y~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:25,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !(~x~0 % 4294967296 > 0); {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} is VALID [2022-04-15 06:40:25,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {355#(<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {351#false} is VALID [2022-04-15 06:40:25,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {351#false} assume !(~z~0 % 4294967296 > 0); {351#false} is VALID [2022-04-15 06:40:25,962 INFO L272 TraceCheckUtils]: 13: Hoare triple {351#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {351#false} is VALID [2022-04-15 06:40:25,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {351#false} ~cond := #in~cond; {351#false} is VALID [2022-04-15 06:40:25,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {351#false} assume 0 == ~cond; {351#false} is VALID [2022-04-15 06:40:25,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {351#false} assume !false; {351#false} is VALID [2022-04-15 06:40:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:25,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842516021] [2022-04-15 06:40:25,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842516021] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:25,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:25,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:25,963 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:25,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1306579244] [2022-04-15 06:40:25,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1306579244] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:25,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:25,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:25,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568338634] [2022-04-15 06:40:25,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:25,964 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:25,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:25,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:25,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:25,975 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:40:25,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:25,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:40:25,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:40:25,976 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:26,062 INFO L93 Difference]: Finished difference Result 35 states and 48 transitions. [2022-04-15 06:40:26,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:40:26,062 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:26,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:26,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 06:40:26,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 06:40:26,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-15 06:40:26,090 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:26,092 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:40:26,092 INFO L226 Difference]: Without dead ends: 28 [2022-04-15 06:40:26,092 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:40:26,095 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:26,099 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 26 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:26,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-15 06:40:26,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-04-15 06:40:26,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:26,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,113 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,113 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:26,116 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-15 06:40:26,117 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 06:40:26,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:26,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:26,117 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 06:40:26,117 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 28 states. [2022-04-15 06:40:26,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:26,118 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2022-04-15 06:40:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 06:40:26,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:26,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:26,119 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:26,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 23 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 39 transitions. [2022-04-15 06:40:26,122 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 39 transitions. Word has length 17 [2022-04-15 06:40:26,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:26,122 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 39 transitions. [2022-04-15 06:40:26,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 39 transitions. [2022-04-15 06:40:26,161 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-15 06:40:26,161 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 39 transitions. [2022-04-15 06:40:26,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:40:26,163 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:26,163 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:26,164 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:40:26,165 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:26,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:26,165 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 1 times [2022-04-15 06:40:26,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:26,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [83574946] [2022-04-15 06:40:26,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:40:26,167 INFO L85 PathProgramCache]: Analyzing trace with hash -615329744, now seen corresponding path program 2 times [2022-04-15 06:40:26,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:26,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664178877] [2022-04-15 06:40:26,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:26,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:26,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:26,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:26,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {549#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {543#true} is VALID [2022-04-15 06:40:26,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-15 06:40:26,201 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-15 06:40:26,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {543#true} call ULTIMATE.init(); {549#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:26,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {549#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {543#true} is VALID [2022-04-15 06:40:26,202 INFO L290 TraceCheckUtils]: 2: Hoare triple {543#true} assume true; {543#true} is VALID [2022-04-15 06:40:26,202 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {543#true} {543#true} #83#return; {543#true} is VALID [2022-04-15 06:40:26,202 INFO L272 TraceCheckUtils]: 4: Hoare triple {543#true} call #t~ret15 := main(); {543#true} is VALID [2022-04-15 06:40:26,202 INFO L290 TraceCheckUtils]: 5: Hoare triple {543#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {543#true} is VALID [2022-04-15 06:40:26,203 INFO L290 TraceCheckUtils]: 6: Hoare triple {543#true} assume !(~x~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:26,203 INFO L290 TraceCheckUtils]: 7: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:26,204 INFO L290 TraceCheckUtils]: 8: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~z~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:26,204 INFO L290 TraceCheckUtils]: 9: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:26,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {548#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {544#false} is VALID [2022-04-15 06:40:26,205 INFO L290 TraceCheckUtils]: 11: Hoare triple {544#false} assume !(~x~0 % 4294967296 > 0); {544#false} is VALID [2022-04-15 06:40:26,205 INFO L290 TraceCheckUtils]: 12: Hoare triple {544#false} assume !(~z~0 % 4294967296 > 0); {544#false} is VALID [2022-04-15 06:40:26,205 INFO L272 TraceCheckUtils]: 13: Hoare triple {544#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {544#false} is VALID [2022-04-15 06:40:26,205 INFO L290 TraceCheckUtils]: 14: Hoare triple {544#false} ~cond := #in~cond; {544#false} is VALID [2022-04-15 06:40:26,205 INFO L290 TraceCheckUtils]: 15: Hoare triple {544#false} assume 0 == ~cond; {544#false} is VALID [2022-04-15 06:40:26,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {544#false} assume !false; {544#false} is VALID [2022-04-15 06:40:26,206 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:26,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:26,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664178877] [2022-04-15 06:40:26,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664178877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:26,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:26,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:26,206 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:26,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [83574946] [2022-04-15 06:40:26,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [83574946] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:26,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:26,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 06:40:26,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043207347] [2022-04-15 06:40:26,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:26,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:26,207 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:26,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:26,217 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 06:40:26,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:26,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 06:40:26,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 06:40:26,218 INFO L87 Difference]: Start difference. First operand 28 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:26,302 INFO L93 Difference]: Finished difference Result 44 states and 63 transitions. [2022-04-15 06:40:26,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 06:40:26,302 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:26,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:26,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 06:40:26,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-15 06:40:26,304 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-15 06:40:26,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:26,333 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:40:26,333 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:40:26,333 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 06:40:26,334 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:26,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 25 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:26,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:40:26,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 06:40:26,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:26,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,350 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,351 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:26,352 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-15 06:40:26,352 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-15 06:40:26,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:26,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:26,353 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:40:26,353 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:40:26,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:26,354 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-15 06:40:26,354 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-15 06:40:26,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:26,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:26,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:26,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:26,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 44 transitions. [2022-04-15 06:40:26,356 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 44 transitions. Word has length 17 [2022-04-15 06:40:26,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:26,356 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 44 transitions. [2022-04-15 06:40:26,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:26,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 44 transitions. [2022-04-15 06:40:26,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 44 transitions. [2022-04-15 06:40:26,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:40:26,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:26,405 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:26,405 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 06:40:26,405 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:26,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:26,406 INFO L85 PathProgramCache]: Analyzing trace with hash -578961840, now seen corresponding path program 1 times [2022-04-15 06:40:26,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:26,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703676088] [2022-04-15 06:40:28,852 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:28,855 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1386235727, now seen corresponding path program 1 times [2022-04-15 06:40:28,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:28,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059220797] [2022-04-15 06:40:28,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:28,884 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:28,917 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_1.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:29,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:29,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {785#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-15 06:40:29,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 06:40:29,032 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-15 06:40:29,032 INFO L272 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {785#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:29,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {785#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {774#true} is VALID [2022-04-15 06:40:29,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {774#true} assume true; {774#true} is VALID [2022-04-15 06:40:29,033 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {774#true} {774#true} #83#return; {774#true} is VALID [2022-04-15 06:40:29,033 INFO L272 TraceCheckUtils]: 4: Hoare triple {774#true} call #t~ret15 := main(); {774#true} is VALID [2022-04-15 06:40:29,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {774#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {779#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:40:29,035 INFO L290 TraceCheckUtils]: 6: Hoare triple {779#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {780#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:40:29,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {780#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} ~z~0 := ~y~0; {780#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:40:29,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {780#(and (= main_~n~0 main_~x~0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [87] L23-2-->L29-1_primed: Formula: (let ((.cse1 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse2 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse3 (= v_main_~x~0_15 v_main_~x~0_14)) (.cse4 (= v_main_~z~0_12 v_main_~z~0_11)) (.cse0 (mod v_main_~z~0_12 4294967296))) (or (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4) (and (= v_main_~x~0_14 (+ v_main_~x~0_15 v_main_~z~0_12 (* (- 1) v_main_~z~0_11))) (< v_main_~z~0_11 v_main_~z~0_12) (< 0 .cse0) (forall ((v_it_1 Int)) (or (not (<= (+ v_main_~z~0_11 v_it_1 1) v_main_~z~0_12)) (< 0 (mod (+ v_main_~z~0_12 (* v_it_1 4294967295)) 4294967296)) (not (<= 1 v_it_1))))))) InVars {main_~x~0=v_main_~x~0_15, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_12, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_14, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_11, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:29,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} [86] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:29,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~y~0 % 4294967296 > 0); {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} is VALID [2022-04-15 06:40:29,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {781#(< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))} assume !(~x~0 % 4294967296 > 0); {782#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:29,039 INFO L290 TraceCheckUtils]: 12: Hoare triple {782#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {782#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:29,040 INFO L272 TraceCheckUtils]: 13: Hoare triple {782#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {783#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:29,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {783#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {784#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:29,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {784#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {775#false} is VALID [2022-04-15 06:40:29,041 INFO L290 TraceCheckUtils]: 16: Hoare triple {775#false} assume !false; {775#false} is VALID [2022-04-15 06:40:29,042 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-15 06:40:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:29,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059220797] [2022-04-15 06:40:29,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059220797] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:29,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:29,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:40:29,450 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:29,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703676088] [2022-04-15 06:40:29,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703676088] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:29,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:29,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 06:40:29,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008807724] [2022-04-15 06:40:29,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:29,451 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:29,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:29,451 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:29,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:29,514 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 06:40:29,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:29,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 06:40:29,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:29,515 INFO L87 Difference]: Start difference. First operand 32 states and 44 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:31,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:31,895 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2022-04-15 06:40:31,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 06:40:31,896 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:31,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:31,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:31,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-15 06:40:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:31,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 49 transitions. [2022-04-15 06:40:31,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 49 transitions. [2022-04-15 06:40:32,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:32,468 INFO L225 Difference]: With dead ends: 47 [2022-04-15 06:40:32,468 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 06:40:32,469 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:40:32,469 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:32,469 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 35 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 64 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-04-15 06:40:32,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 06:40:32,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-04-15 06:40:32,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:32,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:32,499 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:32,500 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:32,501 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-04-15 06:40:32,501 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2022-04-15 06:40:32,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:32,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:32,502 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:40:32,502 INFO L87 Difference]: Start difference. First operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-15 06:40:32,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:32,506 INFO L93 Difference]: Finished difference Result 41 states and 59 transitions. [2022-04-15 06:40:32,506 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 59 transitions. [2022-04-15 06:40:32,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:32,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:32,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:32,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:32,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.53125) internal successors, (49), 32 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 53 transitions. [2022-04-15 06:40:32,511 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 53 transitions. Word has length 17 [2022-04-15 06:40:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:32,511 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 53 transitions. [2022-04-15 06:40:32,511 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 9 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:32,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 53 transitions. [2022-04-15 06:40:32,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 53 transitions. [2022-04-15 06:40:32,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 06:40:32,763 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:32,763 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:32,763 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 06:40:32,763 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:32,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:32,763 INFO L85 PathProgramCache]: Analyzing trace with hash 388404751, now seen corresponding path program 1 times [2022-04-15 06:40:32,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:32,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [595153887] [2022-04-15 06:40:32,962 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:32,964 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:32,966 INFO L85 PathProgramCache]: Analyzing trace with hash -679545490, now seen corresponding path program 1 times [2022-04-15 06:40:32,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:32,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201173752] [2022-04-15 06:40:32,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:32,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:32,974 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:32,994 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:33,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:33,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {1066#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1055#true} is VALID [2022-04-15 06:40:33,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-15 06:40:33,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1055#true} {1055#true} #83#return; {1055#true} is VALID [2022-04-15 06:40:33,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {1055#true} call ULTIMATE.init(); {1066#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:33,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {1066#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1055#true} is VALID [2022-04-15 06:40:33,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {1055#true} assume true; {1055#true} is VALID [2022-04-15 06:40:33,171 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1055#true} {1055#true} #83#return; {1055#true} is VALID [2022-04-15 06:40:33,171 INFO L272 TraceCheckUtils]: 4: Hoare triple {1055#true} call #t~ret15 := main(); {1055#true} is VALID [2022-04-15 06:40:33,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {1055#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1060#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 06:40:33,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {1060#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [89] L16-2-->L16-3_primed: Formula: (let ((.cse1 (mod v_main_~x~0_22 4294967296)) (.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse2 (= v_main_~y~0_11 v_main_~y~0_10)) (.cse3 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse4 (= v_main_~x~0_22 v_main_~x~0_21))) (or (and .cse0 (<= .cse1 0) .cse2 .cse3 .cse4) (and (< v_main_~y~0_11 v_main_~y~0_10) (forall ((v_it_2 Int)) (or (not (<= (+ v_main_~y~0_11 v_it_2 1) v_main_~y~0_10)) (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_22 (* v_it_2 4294967295)) 4294967296)))) (= v_main_~x~0_21 (+ v_main_~x~0_22 v_main_~y~0_11 (* (- 1) v_main_~y~0_10))) (< 0 .cse1)) (and .cse0 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_11, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_22, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_10, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_21, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1061#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:33,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#(or (<= (+ (* (div main_~y~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296)) 1) (+ main_~y~0 main_~x~0)) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [88] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:40:33,179 INFO L290 TraceCheckUtils]: 8: Hoare triple {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} ~z~0 := ~y~0; {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:40:33,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~z~0 % 4294967296 > 0); {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} is VALID [2022-04-15 06:40:33,182 INFO L290 TraceCheckUtils]: 10: Hoare triple {1062#(or (and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1))) (<= (+ (* (div main_~y~0 4294967296) 4294967296) 1) main_~y~0))} assume !(~y~0 % 4294967296 > 0); {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:33,182 INFO L290 TraceCheckUtils]: 11: Hoare triple {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~x~0 % 4294967296 > 0); {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:33,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:33,185 INFO L272 TraceCheckUtils]: 13: Hoare triple {1063#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1064#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:33,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {1064#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1065#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:33,192 INFO L290 TraceCheckUtils]: 15: Hoare triple {1065#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1056#false} is VALID [2022-04-15 06:40:33,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {1056#false} assume !false; {1056#false} is VALID [2022-04-15 06:40:33,194 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-15 06:40:33,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:33,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201173752] [2022-04-15 06:40:33,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201173752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:33,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:33,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:40:33,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:33,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [595153887] [2022-04-15 06:40:33,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [595153887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:33,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:33,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 06:40:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630859044] [2022-04-15 06:40:33,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:33,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:33,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:33,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:33,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 06:40:33,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 06:40:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:33,484 INFO L87 Difference]: Start difference. First operand 37 states and 53 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:33,981 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2022-04-15 06:40:33,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:40:33,981 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-15 06:40:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-15 06:40:33,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 47 transitions. [2022-04-15 06:40:33,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 47 transitions. [2022-04-15 06:40:34,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:34,157 INFO L225 Difference]: With dead ends: 49 [2022-04-15 06:40:34,157 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:40:34,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2022-04-15 06:40:34,158 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:34,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 42 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 74 Invalid, 0 Unknown, 28 Unchecked, 0.1s Time] [2022-04-15 06:40:34,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:40:34,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-04-15 06:40:34,193 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:34,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:34,193 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:34,193 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:34,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:34,194 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-04-15 06:40:34,194 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-04-15 06:40:34,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:34,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:34,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:40:34,195 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:40:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:34,196 INFO L93 Difference]: Finished difference Result 34 states and 48 transitions. [2022-04-15 06:40:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2022-04-15 06:40:34,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:34,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:34,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:34,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:34,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.5) internal successors, (42), 28 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:34,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 46 transitions. [2022-04-15 06:40:34,197 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 46 transitions. Word has length 17 [2022-04-15 06:40:34,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:34,197 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 46 transitions. [2022-04-15 06:40:34,197 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:34,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 46 transitions. [2022-04-15 06:40:36,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 45 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:36,530 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 46 transitions. [2022-04-15 06:40:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:40:36,530 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:36,530 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-15 06:40:36,530 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 06:40:36,530 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:36,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:36,531 INFO L85 PathProgramCache]: Analyzing trace with hash 669375650, now seen corresponding path program 1 times [2022-04-15 06:40:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:36,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2126431975] [2022-04-15 06:40:36,717 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:36,718 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:36,720 INFO L85 PathProgramCache]: Analyzing trace with hash 2035020803, now seen corresponding path program 1 times [2022-04-15 06:40:36,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:36,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088902353] [2022-04-15 06:40:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:36,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:36,729 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:36,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:36,747 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.1))) (+ main_~z~0_7 .cse0 (* (- 4294967296) (div (+ main_~z~0_7 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:36,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:36,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {1324#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-15 06:40:36,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 06:40:36,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1315#true} {1315#true} #83#return; {1315#true} is VALID [2022-04-15 06:40:36,820 INFO L272 TraceCheckUtils]: 0: Hoare triple {1315#true} call ULTIMATE.init(); {1324#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:36,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {1324#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1315#true} is VALID [2022-04-15 06:40:36,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {1315#true} assume true; {1315#true} is VALID [2022-04-15 06:40:36,820 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1315#true} {1315#true} #83#return; {1315#true} is VALID [2022-04-15 06:40:36,820 INFO L272 TraceCheckUtils]: 4: Hoare triple {1315#true} call #t~ret15 := main(); {1315#true} is VALID [2022-04-15 06:40:36,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {1315#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1320#(= main_~y~0 0)} is VALID [2022-04-15 06:40:36,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {1320#(= main_~y~0 0)} assume !(~x~0 % 4294967296 > 0); {1321#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} is VALID [2022-04-15 06:40:36,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {1321#(and (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (= main_~y~0 0))} ~z~0 := ~y~0; {1322#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} is VALID [2022-04-15 06:40:36,823 INFO L290 TraceCheckUtils]: 8: Hoare triple {1322#(and (= main_~z~0 0) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))))} [91] L23-2-->L29-1_primed: Formula: (let ((.cse0 (mod v_main_~z~0_19 4294967296)) (.cse1 (= v_main_~z~0_19 v_main_~z~0_18)) (.cse2 (= v_main_~x~0_29 v_main_~x~0_28)) (.cse3 (= |v_main_#t~post8_9| |v_main_#t~post8_8|)) (.cse4 (= |v_main_#t~post7_9| |v_main_#t~post7_8|))) (or (and (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~z~0_19 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_29 v_it_3 1) v_main_~x~0_28)))) (= v_main_~z~0_18 (+ v_main_~x~0_29 v_main_~z~0_19 (* (- 1) v_main_~x~0_28))) (< v_main_~x~0_29 v_main_~x~0_28) (< 0 .cse0)) (and .cse1 .cse2 .cse3 (<= .cse0 0) .cse4) (and .cse1 .cse2 .cse3 .cse4))) InVars {main_~x~0=v_main_~x~0_29, main_#t~post8=|v_main_#t~post8_9|, main_~z~0=v_main_~z~0_19, main_#t~post7=|v_main_#t~post7_9|} OutVars{main_~x~0=v_main_~x~0_28, main_#t~post8=|v_main_#t~post8_8|, main_~z~0=v_main_~z~0_18, main_#t~post7=|v_main_#t~post7_8|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:36,823 INFO L290 TraceCheckUtils]: 9: Hoare triple {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} [90] L29-1_primed-->L29-1: Formula: (not (< 0 (mod v_main_~z~0_5 4294967296))) InVars {main_~z~0=v_main_~z~0_5} OutVars{main_~z~0=v_main_~z~0_5} AuxVars[] AssignedVars[] {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:36,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !(~y~0 % 4294967296 > 0); {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:36,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {1323#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {1316#false} is VALID [2022-04-15 06:40:36,824 INFO L290 TraceCheckUtils]: 12: Hoare triple {1316#false} assume !(~x~0 % 4294967296 > 0); {1316#false} is VALID [2022-04-15 06:40:36,824 INFO L290 TraceCheckUtils]: 13: Hoare triple {1316#false} assume !(~z~0 % 4294967296 > 0); {1316#false} is VALID [2022-04-15 06:40:36,825 INFO L272 TraceCheckUtils]: 14: Hoare triple {1316#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1316#false} is VALID [2022-04-15 06:40:36,825 INFO L290 TraceCheckUtils]: 15: Hoare triple {1316#false} ~cond := #in~cond; {1316#false} is VALID [2022-04-15 06:40:36,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {1316#false} assume 0 == ~cond; {1316#false} is VALID [2022-04-15 06:40:36,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {1316#false} assume !false; {1316#false} is VALID [2022-04-15 06:40:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:36,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:36,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088902353] [2022-04-15 06:40:36,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088902353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:36,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:36,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:40:36,852 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:36,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2126431975] [2022-04-15 06:40:36,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2126431975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:36,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:36,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 06:40:36,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203379867] [2022-04-15 06:40:36,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:36,854 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:40:36,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:36,855 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:36,867 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-15 06:40:36,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 06:40:36,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:36,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 06:40:36,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-15 06:40:36,868 INFO L87 Difference]: Start difference. First operand 33 states and 46 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:37,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:37,044 INFO L93 Difference]: Finished difference Result 44 states and 60 transitions. [2022-04-15 06:40:37,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:40:37,044 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:40:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:37,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:37,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-15 06:40:37,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:37,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-15 06:40:37,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-15 06:40:37,084 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-15 06:40:37,084 INFO L225 Difference]: With dead ends: 44 [2022-04-15 06:40:37,084 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 06:40:37,085 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:37,085 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:37,085 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 33 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 06:40:37,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-15 06:40:37,106 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:37,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:37,106 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:37,106 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:37,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:37,107 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-15 06:40:37,107 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-15 06:40:37,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:37,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:37,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:40:37,108 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-15 06:40:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:37,109 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2022-04-15 06:40:37,109 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-04-15 06:40:37,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:37,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:37,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:37,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:37,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:37,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-04-15 06:40:37,110 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 18 [2022-04-15 06:40:37,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:37,110 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-04-15 06:40:37,110 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:37,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 33 transitions. [2022-04-15 06:40:37,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:37,641 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-04-15 06:40:37,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:40:37,641 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:37,642 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-15 06:40:37,642 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 06:40:37,642 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:37,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:37,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1130976308, now seen corresponding path program 1 times [2022-04-15 06:40:37,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:37,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699149844] [2022-04-15 06:40:37,827 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:37,828 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:37,831 INFO L85 PathProgramCache]: Analyzing trace with hash 7749941, now seen corresponding path program 1 times [2022-04-15 06:40:37,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:37,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483514916] [2022-04-15 06:40:37,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:37,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:37,838 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:40:37,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:37,850 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_4.1))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:40:37,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:37,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {1534#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1527#true} is VALID [2022-04-15 06:40:37,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-15 06:40:37,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1527#true} {1527#true} #83#return; {1527#true} is VALID [2022-04-15 06:40:37,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {1527#true} call ULTIMATE.init(); {1534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:37,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {1534#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1527#true} is VALID [2022-04-15 06:40:37,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#true} assume true; {1527#true} is VALID [2022-04-15 06:40:37,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1527#true} {1527#true} #83#return; {1527#true} is VALID [2022-04-15 06:40:37,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {1527#true} call #t~ret15 := main(); {1527#true} is VALID [2022-04-15 06:40:37,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {1527#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1527#true} is VALID [2022-04-15 06:40:37,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {1527#true} [93] L16-2-->L16-3_primed: Formula: (let ((.cse4 (mod v_main_~x~0_37 4294967296)) (.cse0 (= v_main_~x~0_37 v_main_~x~0_36)) (.cse1 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse2 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse3 (= v_main_~y~0_19 v_main_~y~0_18))) (or (and .cse0 .cse1 .cse2 .cse3) (and (< 0 .cse4) (< v_main_~x~0_36 v_main_~x~0_37) (= (+ v_main_~x~0_37 v_main_~y~0_19 (* (- 1) v_main_~x~0_36)) v_main_~y~0_18) (forall ((v_it_4 Int)) (or (< 0 (mod (+ (* v_it_4 4294967295) v_main_~x~0_37) 4294967296)) (not (<= 1 v_it_4)) (not (<= (+ v_main_~x~0_36 v_it_4 1) v_main_~x~0_37))))) (and (<= .cse4 0) .cse0 .cse1 .cse2 .cse3))) InVars {main_~y~0=v_main_~y~0_19, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_37, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_18, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_36, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1527#true} is VALID [2022-04-15 06:40:37,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {1527#true} [92] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1527#true} is VALID [2022-04-15 06:40:37,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {1527#true} ~z~0 := ~y~0; {1532#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} is VALID [2022-04-15 06:40:37,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {1532#(= (+ main_~z~0 (* (- 1) main_~y~0)) 0)} assume !(~z~0 % 4294967296 > 0); {1533#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:37,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {1533#(and (= main_~z~0 main_~y~0) (<= main_~z~0 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1528#false} is VALID [2022-04-15 06:40:37,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {1528#false} assume !(~y~0 % 4294967296 > 0); {1528#false} is VALID [2022-04-15 06:40:37,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {1528#false} assume !(~x~0 % 4294967296 > 0); {1528#false} is VALID [2022-04-15 06:40:37,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {1528#false} assume !(~z~0 % 4294967296 > 0); {1528#false} is VALID [2022-04-15 06:40:37,903 INFO L272 TraceCheckUtils]: 14: Hoare triple {1528#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1528#false} is VALID [2022-04-15 06:40:37,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {1528#false} ~cond := #in~cond; {1528#false} is VALID [2022-04-15 06:40:37,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {1528#false} assume 0 == ~cond; {1528#false} is VALID [2022-04-15 06:40:37,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {1528#false} assume !false; {1528#false} is VALID [2022-04-15 06:40:37,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:37,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:37,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483514916] [2022-04-15 06:40:37,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483514916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:37,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:37,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:40:37,928 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:37,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699149844] [2022-04-15 06:40:37,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699149844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:37,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:37,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:37,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723707936] [2022-04-15 06:40:37,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:37,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:40:37,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:37,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:37,939 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-15 06:40:37,939 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:37,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:37,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:37,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:40:37,940 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:38,124 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2022-04-15 06:40:38,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:40:38,124 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:40:38,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 06:40:38,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-15 06:40:38,126 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-15 06:40:38,156 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-15 06:40:38,157 INFO L225 Difference]: With dead ends: 35 [2022-04-15 06:40:38,157 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 06:40:38,157 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:40:38,158 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:38,158 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 34 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:38,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 06:40:38,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2022-04-15 06:40:38,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:38,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,177 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,177 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:38,178 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-15 06:40:38,178 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-15 06:40:38,178 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:38,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:38,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 06:40:38,178 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 26 states. [2022-04-15 06:40:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:38,179 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2022-04-15 06:40:38,179 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2022-04-15 06:40:38,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:38,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:38,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:38,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.411764705882353) internal successors, (24), 17 states have internal predecessors, (24), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-04-15 06:40:38,180 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2022-04-15 06:40:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:38,181 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-04-15 06:40:38,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 28 transitions. [2022-04-15 06:40:38,341 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-15 06:40:38,341 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-04-15 06:40:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 06:40:38,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:38,341 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-15 06:40:38,341 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 06:40:38,342 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:38,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash 629336803, now seen corresponding path program 1 times [2022-04-15 06:40:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:38,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1191509547] [2022-04-15 06:40:38,568 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:38,570 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:38,572 INFO L85 PathProgramCache]: Analyzing trace with hash 465340452, now seen corresponding path program 1 times [2022-04-15 06:40:38,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:38,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035598498] [2022-04-15 06:40:38,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:38,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:38,579 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:38,588 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_5.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:38,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:38,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {1718#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1711#true} is VALID [2022-04-15 06:40:38,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {1711#true} assume true; {1711#true} is VALID [2022-04-15 06:40:38,623 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1711#true} {1711#true} #83#return; {1711#true} is VALID [2022-04-15 06:40:38,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {1711#true} call ULTIMATE.init(); {1718#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:38,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {1718#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1711#true} is VALID [2022-04-15 06:40:38,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {1711#true} assume true; {1711#true} is VALID [2022-04-15 06:40:38,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1711#true} {1711#true} #83#return; {1711#true} is VALID [2022-04-15 06:40:38,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {1711#true} call #t~ret15 := main(); {1711#true} is VALID [2022-04-15 06:40:38,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {1711#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1711#true} is VALID [2022-04-15 06:40:38,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {1711#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_44 4294967296)) (.cse1 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse2 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse3 (= v_main_~y~0_27 v_main_~y~0_26)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< v_main_~x~0_43 v_main_~x~0_44) (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~x~0_43 v_it_5 1) v_main_~x~0_44)) (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (= v_main_~y~0_26 (+ v_main_~x~0_44 v_main_~y~0_27 (* (- 1) v_main_~x~0_43)))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_27, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_26, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1711#true} is VALID [2022-04-15 06:40:38,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {1711#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1716#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:38,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {1716#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1716#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:38,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {1716#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:38,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:38,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:38,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {1717#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-15 06:40:38,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#false} assume !(~z~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-15 06:40:38,628 INFO L272 TraceCheckUtils]: 14: Hoare triple {1712#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1712#false} is VALID [2022-04-15 06:40:38,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {1712#false} ~cond := #in~cond; {1712#false} is VALID [2022-04-15 06:40:38,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#false} assume 0 == ~cond; {1712#false} is VALID [2022-04-15 06:40:38,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#false} assume !false; {1712#false} is VALID [2022-04-15 06:40:38,629 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:38,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:38,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035598498] [2022-04-15 06:40:38,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035598498] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:38,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075302961] [2022-04-15 06:40:38,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:38,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:38,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:38,639 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-15 06:40:38,643 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-15 06:40:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:38,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 06:40:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:38,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:38,734 INFO L272 TraceCheckUtils]: 0: Hoare triple {1711#true} call ULTIMATE.init(); {1711#true} is VALID [2022-04-15 06:40:38,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {1711#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(10, 2);call #Ultimate.allocInit(12, 3); {1711#true} is VALID [2022-04-15 06:40:38,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {1711#true} assume true; {1711#true} is VALID [2022-04-15 06:40:38,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1711#true} {1711#true} #83#return; {1711#true} is VALID [2022-04-15 06:40:38,735 INFO L272 TraceCheckUtils]: 4: Hoare triple {1711#true} call #t~ret15 := main(); {1711#true} is VALID [2022-04-15 06:40:38,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {1711#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1711#true} is VALID [2022-04-15 06:40:38,736 INFO L290 TraceCheckUtils]: 6: Hoare triple {1711#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_44 4294967296)) (.cse1 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse2 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse3 (= v_main_~y~0_27 v_main_~y~0_26)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< v_main_~x~0_43 v_main_~x~0_44) (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~x~0_43 v_it_5 1) v_main_~x~0_44)) (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (= v_main_~y~0_26 (+ v_main_~x~0_44 v_main_~y~0_27 (* (- 1) v_main_~x~0_43)))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_27, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_26, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1711#true} is VALID [2022-04-15 06:40:38,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {1711#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1711#true} is VALID [2022-04-15 06:40:38,736 INFO L290 TraceCheckUtils]: 8: Hoare triple {1711#true} ~z~0 := ~y~0; {1746#(= main_~z~0 main_~y~0)} is VALID [2022-04-15 06:40:38,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {1746#(= main_~z~0 main_~y~0)} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1750#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:40:38,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {1750#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1750#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:40:38,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {1750#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-15 06:40:38,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#false} assume !(~x~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-15 06:40:38,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#false} assume !(~z~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-15 06:40:38,738 INFO L272 TraceCheckUtils]: 14: Hoare triple {1712#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1712#false} is VALID [2022-04-15 06:40:38,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {1712#false} ~cond := #in~cond; {1712#false} is VALID [2022-04-15 06:40:38,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#false} assume 0 == ~cond; {1712#false} is VALID [2022-04-15 06:40:38,738 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#false} assume !false; {1712#false} is VALID [2022-04-15 06:40:38,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:38,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:38,799 INFO L290 TraceCheckUtils]: 17: Hoare triple {1712#false} assume !false; {1712#false} is VALID [2022-04-15 06:40:38,799 INFO L290 TraceCheckUtils]: 16: Hoare triple {1712#false} assume 0 == ~cond; {1712#false} is VALID [2022-04-15 06:40:38,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {1712#false} ~cond := #in~cond; {1712#false} is VALID [2022-04-15 06:40:38,799 INFO L272 TraceCheckUtils]: 14: Hoare triple {1712#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1712#false} is VALID [2022-04-15 06:40:38,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {1712#false} assume !(~z~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-15 06:40:38,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {1712#false} assume !(~x~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-15 06:40:38,802 INFO L290 TraceCheckUtils]: 11: Hoare triple {1750#(< 0 (mod main_~y~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {1712#false} is VALID [2022-04-15 06:40:38,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {1750#(< 0 (mod main_~y~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1750#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:40:38,803 INFO L290 TraceCheckUtils]: 9: Hoare triple {1799#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1750#(< 0 (mod main_~y~0 4294967296))} is VALID [2022-04-15 06:40:38,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {1711#true} ~z~0 := ~y~0; {1799#(or (not (< 0 (mod main_~z~0 4294967296))) (< 0 (mod main_~y~0 4294967296)))} is VALID [2022-04-15 06:40:38,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {1711#true} [94] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1711#true} is VALID [2022-04-15 06:40:38,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {1711#true} [95] L16-2-->L16-3_primed: Formula: (let ((.cse0 (mod v_main_~x~0_44 4294967296)) (.cse1 (= |v_main_#t~post6_14| |v_main_#t~post6_13|)) (.cse2 (= v_main_~x~0_44 v_main_~x~0_43)) (.cse3 (= v_main_~y~0_27 v_main_~y~0_26)) (.cse4 (= |v_main_#t~post5_14| |v_main_#t~post5_13|))) (or (and (< v_main_~x~0_43 v_main_~x~0_44) (< 0 .cse0) (forall ((v_it_5 Int)) (or (not (<= (+ v_main_~x~0_43 v_it_5 1) v_main_~x~0_44)) (< 0 (mod (+ v_main_~x~0_44 (* v_it_5 4294967295)) 4294967296)) (not (<= 1 v_it_5)))) (= v_main_~y~0_26 (+ v_main_~x~0_44 v_main_~y~0_27 (* (- 1) v_main_~x~0_43)))) (and .cse1 .cse2 .cse3 .cse4) (and (<= .cse0 0) .cse1 .cse2 .cse3 .cse4))) InVars {main_~y~0=v_main_~y~0_27, main_#t~post5=|v_main_#t~post5_14|, main_~x~0=v_main_~x~0_44, main_#t~post6=|v_main_#t~post6_14|} OutVars{main_~y~0=v_main_~y~0_26, main_#t~post5=|v_main_#t~post5_13|, main_~x~0=v_main_~x~0_43, main_#t~post6=|v_main_#t~post6_13|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1711#true} is VALID [2022-04-15 06:40:38,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {1711#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1711#true} is VALID [2022-04-15 06:40:38,804 INFO L272 TraceCheckUtils]: 4: Hoare triple {1711#true} call #t~ret15 := main(); {1711#true} is VALID [2022-04-15 06:40:38,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1711#true} {1711#true} #83#return; {1711#true} is VALID [2022-04-15 06:40:38,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {1711#true} assume true; {1711#true} is VALID [2022-04-15 06:40:38,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {1711#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(10, 2);call #Ultimate.allocInit(12, 3); {1711#true} is VALID [2022-04-15 06:40:38,804 INFO L272 TraceCheckUtils]: 0: Hoare triple {1711#true} call ULTIMATE.init(); {1711#true} is VALID [2022-04-15 06:40:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:38,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075302961] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:38,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-04-15 06:40:38,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 8 [2022-04-15 06:40:38,880 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:38,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1191509547] [2022-04-15 06:40:38,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1191509547] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:38,880 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:38,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 06:40:38,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727443095] [2022-04-15 06:40:38,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:38,881 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:40:38,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:38,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:38,894 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-15 06:40:38,895 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 06:40:38,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:38,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 06:40:38,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-15 06:40:38,896 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:39,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:39,025 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-04-15 06:40:39,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 06:40:39,025 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-15 06:40:39,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:39,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:39,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-15 06:40:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-04-15 06:40:39,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-04-15 06:40:39,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:39,062 INFO L225 Difference]: With dead ends: 30 [2022-04-15 06:40:39,062 INFO L226 Difference]: Without dead ends: 23 [2022-04-15 06:40:39,062 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:40:39,063 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:39,063 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 48 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 06:40:39,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-15 06:40:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2022-04-15 06:40:39,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:39,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:39,084 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:39,084 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:39,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:39,085 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 06:40:39,085 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 06:40:39,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:39,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:39,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:40:39,086 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 23 states. [2022-04-15 06:40:39,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:39,087 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2022-04-15 06:40:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2022-04-15 06:40:39,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:39,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:39,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:39,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:39,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-04-15 06:40:39,088 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 18 [2022-04-15 06:40:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:39,088 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-04-15 06:40:39,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:39,088 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 24 transitions. [2022-04-15 06:40:39,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:39,227 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-15 06:40:39,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 06:40:39,227 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:39,227 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:40:39,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 06:40:39,428 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:39,428 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:39,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash 9935328, now seen corresponding path program 1 times [2022-04-15 06:40:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:39,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913120876] [2022-04-15 06:40:39,620 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:39,621 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:39,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1107624833, now seen corresponding path program 1 times [2022-04-15 06:40:39,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:39,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016905926] [2022-04-15 06:40:39,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:39,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:39,631 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:39,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:39,644 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_6.1))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:39,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:39,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {1985#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1978#true} is VALID [2022-04-15 06:40:39,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-15 06:40:39,680 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1978#true} {1978#true} #83#return; {1978#true} is VALID [2022-04-15 06:40:39,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1985#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:39,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {1985#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {1978#true} is VALID [2022-04-15 06:40:39,680 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-15 06:40:39,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #83#return; {1978#true} is VALID [2022-04-15 06:40:39,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret15 := main(); {1978#true} is VALID [2022-04-15 06:40:39,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1978#true} is VALID [2022-04-15 06:40:39,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_52 v_main_~x~0_51)) (.cse1 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|)) (.cse2 (mod v_main_~x~0_52 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_6 Int)) (or (< 0 (mod (+ v_main_~x~0_52 (* v_it_6 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_34 v_it_6 1) v_main_~y~0_33)) (not (<= 1 v_it_6)))) (= v_main_~x~0_51 (+ v_main_~x~0_52 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_51, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1978#true} is VALID [2022-04-15 06:40:39,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1983#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:39,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {1983#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} ~z~0 := ~y~0; {1983#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} is VALID [2022-04-15 06:40:39,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {1983#(<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:39,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~z~0 % 4294967296 > 0); {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:39,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:39,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~y~0 % 4294967296 > 0); {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} is VALID [2022-04-15 06:40:39,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {1984#(<= (+ (* 4294967296 (div main_~x~0 4294967296)) 1) main_~x~0)} assume !(~x~0 % 4294967296 > 0); {1979#false} is VALID [2022-04-15 06:40:39,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {1979#false} assume !(~z~0 % 4294967296 > 0); {1979#false} is VALID [2022-04-15 06:40:39,685 INFO L272 TraceCheckUtils]: 15: Hoare triple {1979#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1979#false} is VALID [2022-04-15 06:40:39,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#false} ~cond := #in~cond; {1979#false} is VALID [2022-04-15 06:40:39,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#false} assume 0 == ~cond; {1979#false} is VALID [2022-04-15 06:40:39,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-15 06:40:39,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:39,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:39,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016905926] [2022-04-15 06:40:39,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016905926] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:39,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539474298] [2022-04-15 06:40:39,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:39,686 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:39,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:39,687 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-15 06:40:39,711 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-15 06:40:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:39,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 06:40:39,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:39,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:39,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-15 06:40:39,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#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(10, 2);call #Ultimate.allocInit(12, 3); {1978#true} is VALID [2022-04-15 06:40:39,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-15 06:40:39,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #83#return; {1978#true} is VALID [2022-04-15 06:40:39,810 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret15 := main(); {1978#true} is VALID [2022-04-15 06:40:39,810 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1978#true} is VALID [2022-04-15 06:40:39,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_52 v_main_~x~0_51)) (.cse1 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|)) (.cse2 (mod v_main_~x~0_52 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_6 Int)) (or (< 0 (mod (+ v_main_~x~0_52 (* v_it_6 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_34 v_it_6 1) v_main_~y~0_33)) (not (<= 1 v_it_6)))) (= v_main_~x~0_51 (+ v_main_~x~0_52 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_51, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1978#true} is VALID [2022-04-15 06:40:39,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 06:40:39,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} ~z~0 := ~y~0; {1978#true} is VALID [2022-04-15 06:40:39,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:40:39,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:40:39,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:40:39,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:40:39,815 INFO L290 TraceCheckUtils]: 13: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:40:39,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1979#false} is VALID [2022-04-15 06:40:39,815 INFO L272 TraceCheckUtils]: 15: Hoare triple {1979#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1979#false} is VALID [2022-04-15 06:40:39,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#false} ~cond := #in~cond; {1979#false} is VALID [2022-04-15 06:40:39,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#false} assume 0 == ~cond; {1979#false} is VALID [2022-04-15 06:40:39,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-15 06:40:39,819 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:39,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:39,871 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#false} assume !false; {1979#false} is VALID [2022-04-15 06:40:39,871 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#false} assume 0 == ~cond; {1979#false} is VALID [2022-04-15 06:40:39,871 INFO L290 TraceCheckUtils]: 16: Hoare triple {1979#false} ~cond := #in~cond; {1979#false} is VALID [2022-04-15 06:40:39,871 INFO L272 TraceCheckUtils]: 15: Hoare triple {1979#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {1979#false} is VALID [2022-04-15 06:40:39,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~z~0 % 4294967296 > 0); {1979#false} is VALID [2022-04-15 06:40:39,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~x~0 % 4294967296 > 0); {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:40:39,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {2023#(< 0 (mod main_~z~0 4294967296))} assume !(~y~0 % 4294967296 > 0); {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:40:39,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2023#(< 0 (mod main_~z~0 4294967296))} is VALID [2022-04-15 06:40:39,874 INFO L290 TraceCheckUtils]: 10: Hoare triple {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} assume !(~z~0 % 4294967296 > 0); {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:40:39,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {1978#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2016#(< 0 (mod (+ main_~z~0 1) 4294967296))} is VALID [2022-04-15 06:40:39,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {1978#true} ~z~0 := ~y~0; {1978#true} is VALID [2022-04-15 06:40:39,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {1978#true} [96] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {1978#true} is VALID [2022-04-15 06:40:39,875 INFO L290 TraceCheckUtils]: 6: Hoare triple {1978#true} [97] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~x~0_52 v_main_~x~0_51)) (.cse1 (= v_main_~y~0_34 v_main_~y~0_33)) (.cse3 (= |v_main_#t~post6_19| |v_main_#t~post6_18|)) (.cse4 (= |v_main_#t~post5_19| |v_main_#t~post5_18|)) (.cse2 (mod v_main_~x~0_52 4294967296))) (or (and .cse0 .cse1 (<= .cse2 0) .cse3 .cse4) (and .cse0 .cse1 .cse3 .cse4) (and (< 0 .cse2) (< v_main_~y~0_34 v_main_~y~0_33) (forall ((v_it_6 Int)) (or (< 0 (mod (+ v_main_~x~0_52 (* v_it_6 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_34 v_it_6 1) v_main_~y~0_33)) (not (<= 1 v_it_6)))) (= v_main_~x~0_51 (+ v_main_~x~0_52 v_main_~y~0_34 (* (- 1) v_main_~y~0_33)))))) InVars {main_~y~0=v_main_~y~0_34, main_#t~post5=|v_main_#t~post5_19|, main_~x~0=v_main_~x~0_52, main_#t~post6=|v_main_#t~post6_19|} OutVars{main_~y~0=v_main_~y~0_33, main_#t~post5=|v_main_#t~post5_18|, main_~x~0=v_main_~x~0_51, main_#t~post6=|v_main_#t~post6_18|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {1978#true} is VALID [2022-04-15 06:40:39,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {1978#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {1978#true} is VALID [2022-04-15 06:40:39,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {1978#true} call #t~ret15 := main(); {1978#true} is VALID [2022-04-15 06:40:39,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1978#true} {1978#true} #83#return; {1978#true} is VALID [2022-04-15 06:40:39,875 INFO L290 TraceCheckUtils]: 2: Hoare triple {1978#true} assume true; {1978#true} is VALID [2022-04-15 06:40:39,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {1978#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(10, 2);call #Ultimate.allocInit(12, 3); {1978#true} is VALID [2022-04-15 06:40:39,875 INFO L272 TraceCheckUtils]: 0: Hoare triple {1978#true} call ULTIMATE.init(); {1978#true} is VALID [2022-04-15 06:40:39,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 06:40:39,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539474298] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:39,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:39,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 7 [2022-04-15 06:40:39,926 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:39,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913120876] [2022-04-15 06:40:39,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913120876] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:39,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:39,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:39,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137095515] [2022-04-15 06:40:39,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:39,928 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:40:39,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:39,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:39,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:39,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:39,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:39,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:40:39,943 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:40,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:40,190 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2022-04-15 06:40:40,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:40:40,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-15 06:40:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:40,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-15 06:40:40,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:40,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 52 transitions. [2022-04-15 06:40:40,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 52 transitions. [2022-04-15 06:40:40,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:40,244 INFO L225 Difference]: With dead ends: 41 [2022-04-15 06:40:40,244 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 06:40:40,244 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:40:40,245 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:40,245 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 30 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:40,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 06:40:40,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 25. [2022-04-15 06:40:40,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:40,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:40,273 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:40,273 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:40,274 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 06:40:40,274 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 06:40:40,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:40,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:40,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:40:40,275 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-15 06:40:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:40,275 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-15 06:40:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 06:40:40,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:40,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:40,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:40,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.4) internal successors, (28), 20 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-04-15 06:40:40,276 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 19 [2022-04-15 06:40:40,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:40,277 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-04-15 06:40:40,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:40,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 32 transitions. [2022-04-15 06:40:40,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-04-15 06:40:40,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 06:40:40,383 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:40,384 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-15 06:40:40,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-15 06:40:40,584 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,SelfDestructingSolverStorable9 [2022-04-15 06:40:40,584 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:40,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1745318674, now seen corresponding path program 1 times [2022-04-15 06:40:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:40,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [751278534] [2022-04-15 06:40:42,806 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:42,807 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:42,809 INFO L85 PathProgramCache]: Analyzing trace with hash -137231213, now seen corresponding path program 1 times [2022-04-15 06:40:42,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:42,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421390391] [2022-04-15 06:40:42,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:42,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:42,822 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:42,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:42,837 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_7.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:40:42,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:42,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:42,867 INFO L290 TraceCheckUtils]: 0: Hoare triple {2319#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {2312#true} is VALID [2022-04-15 06:40:42,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#true} assume true; {2312#true} is VALID [2022-04-15 06:40:42,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2312#true} {2312#true} #83#return; {2312#true} is VALID [2022-04-15 06:40:42,868 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} call ULTIMATE.init(); {2319#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:42,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {2319#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {2312#true} is VALID [2022-04-15 06:40:42,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} assume true; {2312#true} is VALID [2022-04-15 06:40:42,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} #83#return; {2312#true} is VALID [2022-04-15 06:40:42,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} call #t~ret15 := main(); {2312#true} is VALID [2022-04-15 06:40:42,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2312#true} is VALID [2022-04-15 06:40:42,869 INFO L290 TraceCheckUtils]: 6: Hoare triple {2312#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_42 v_main_~y~0_41)) (.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~x~0_60 v_main_~x~0_59)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse3 (mod v_main_~x~0_60 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_main_~x~0_59 v_it_7 1) v_main_~x~0_60)) (< 0 (mod (+ v_main_~x~0_60 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< v_main_~x~0_59 v_main_~x~0_60) (< 0 .cse3) (= v_main_~y~0_41 (+ v_main_~x~0_60 v_main_~y~0_42 (* (- 1) v_main_~x~0_59)))))) InVars {main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_59, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2312#true} is VALID [2022-04-15 06:40:42,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {2312#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-15 06:40:42,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {2312#true} ~z~0 := ~y~0; {2312#true} is VALID [2022-04-15 06:40:42,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:42,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:42,871 INFO L290 TraceCheckUtils]: 11: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:42,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:42,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:42,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:42,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2313#false} is VALID [2022-04-15 06:40:42,872 INFO L272 TraceCheckUtils]: 16: Hoare triple {2313#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2313#false} is VALID [2022-04-15 06:40:42,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {2313#false} ~cond := #in~cond; {2313#false} is VALID [2022-04-15 06:40:42,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {2313#false} assume 0 == ~cond; {2313#false} is VALID [2022-04-15 06:40:42,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {2313#false} assume !false; {2313#false} is VALID [2022-04-15 06:40:42,874 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:42,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:42,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421390391] [2022-04-15 06:40:42,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421390391] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:42,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247073676] [2022-04-15 06:40:42,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:42,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:42,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:42,875 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-15 06:40:42,876 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-15 06:40:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:42,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:40:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:42,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:40:43,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} call ULTIMATE.init(); {2312#true} is VALID [2022-04-15 06:40:43,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#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(10, 2);call #Ultimate.allocInit(12, 3); {2312#true} is VALID [2022-04-15 06:40:43,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} assume true; {2312#true} is VALID [2022-04-15 06:40:43,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} #83#return; {2312#true} is VALID [2022-04-15 06:40:43,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} call #t~ret15 := main(); {2312#true} is VALID [2022-04-15 06:40:43,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2312#true} is VALID [2022-04-15 06:40:43,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {2312#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_42 v_main_~y~0_41)) (.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~x~0_60 v_main_~x~0_59)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse3 (mod v_main_~x~0_60 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_main_~x~0_59 v_it_7 1) v_main_~x~0_60)) (< 0 (mod (+ v_main_~x~0_60 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< v_main_~x~0_59 v_main_~x~0_60) (< 0 .cse3) (= v_main_~y~0_41 (+ v_main_~x~0_60 v_main_~y~0_42 (* (- 1) v_main_~x~0_59)))))) InVars {main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_59, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2312#true} is VALID [2022-04-15 06:40:43,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {2312#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-15 06:40:43,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {2312#true} ~z~0 := ~y~0; {2312#true} is VALID [2022-04-15 06:40:43,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:43,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:43,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:43,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:43,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:43,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:43,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2313#false} is VALID [2022-04-15 06:40:43,127 INFO L272 TraceCheckUtils]: 16: Hoare triple {2313#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2313#false} is VALID [2022-04-15 06:40:43,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {2313#false} ~cond := #in~cond; {2313#false} is VALID [2022-04-15 06:40:43,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {2313#false} assume 0 == ~cond; {2313#false} is VALID [2022-04-15 06:40:43,127 INFO L290 TraceCheckUtils]: 19: Hoare triple {2313#false} assume !false; {2313#false} is VALID [2022-04-15 06:40:43,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:43,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:40:43,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {2313#false} assume !false; {2313#false} is VALID [2022-04-15 06:40:43,359 INFO L290 TraceCheckUtils]: 18: Hoare triple {2313#false} assume 0 == ~cond; {2313#false} is VALID [2022-04-15 06:40:43,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {2313#false} ~cond := #in~cond; {2313#false} is VALID [2022-04-15 06:40:43,359 INFO L272 TraceCheckUtils]: 16: Hoare triple {2313#false} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2313#false} is VALID [2022-04-15 06:40:43,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~z~0 % 4294967296 > 0); {2313#false} is VALID [2022-04-15 06:40:43,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~x~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:43,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:43,361 INFO L290 TraceCheckUtils]: 12: Hoare triple {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} assume !(~y~0 % 4294967296 > 0); {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:43,362 INFO L290 TraceCheckUtils]: 11: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2318#(<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0)} is VALID [2022-04-15 06:40:43,362 INFO L290 TraceCheckUtils]: 10: Hoare triple {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} assume !(~z~0 % 4294967296 > 0); {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:43,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {2312#true} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2317#(<= main_~z~0 (+ 4294967294 (* (div main_~z~0 4294967296) 4294967296)))} is VALID [2022-04-15 06:40:43,363 INFO L290 TraceCheckUtils]: 8: Hoare triple {2312#true} ~z~0 := ~y~0; {2312#true} is VALID [2022-04-15 06:40:43,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {2312#true} [98] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2312#true} is VALID [2022-04-15 06:40:43,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {2312#true} [99] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_42 v_main_~y~0_41)) (.cse1 (= |v_main_#t~post5_24| |v_main_#t~post5_23|)) (.cse2 (= v_main_~x~0_60 v_main_~x~0_59)) (.cse4 (= |v_main_#t~post6_24| |v_main_#t~post6_23|)) (.cse3 (mod v_main_~x~0_60 4294967296))) (or (and .cse0 .cse1 .cse2 (<= .cse3 0) .cse4) (and .cse0 .cse1 .cse2 .cse4) (and (forall ((v_it_7 Int)) (or (not (<= (+ v_main_~x~0_59 v_it_7 1) v_main_~x~0_60)) (< 0 (mod (+ v_main_~x~0_60 (* v_it_7 4294967295)) 4294967296)) (not (<= 1 v_it_7)))) (< v_main_~x~0_59 v_main_~x~0_60) (< 0 .cse3) (= v_main_~y~0_41 (+ v_main_~x~0_60 v_main_~y~0_42 (* (- 1) v_main_~x~0_59)))))) InVars {main_~y~0=v_main_~y~0_42, main_#t~post5=|v_main_#t~post5_24|, main_~x~0=v_main_~x~0_60, main_#t~post6=|v_main_#t~post6_24|} OutVars{main_~y~0=v_main_~y~0_41, main_#t~post5=|v_main_#t~post5_23|, main_~x~0=v_main_~x~0_59, main_#t~post6=|v_main_#t~post6_23|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2312#true} is VALID [2022-04-15 06:40:43,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2312#true} is VALID [2022-04-15 06:40:43,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {2312#true} call #t~ret15 := main(); {2312#true} is VALID [2022-04-15 06:40:43,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2312#true} {2312#true} #83#return; {2312#true} is VALID [2022-04-15 06:40:43,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {2312#true} assume true; {2312#true} is VALID [2022-04-15 06:40:43,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#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(10, 2);call #Ultimate.allocInit(12, 3); {2312#true} is VALID [2022-04-15 06:40:43,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {2312#true} call ULTIMATE.init(); {2312#true} is VALID [2022-04-15 06:40:43,364 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:43,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247073676] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:40:43,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:40:43,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-04-15 06:40:43,430 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:40:43,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [751278534] [2022-04-15 06:40:43,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [751278534] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:40:43,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:40:43,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:40:43,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582575678] [2022-04-15 06:40:43,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:40:43,431 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:40:43,431 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:40:43,432 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:43,446 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-15 06:40:43,446 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:40:43,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:43,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:40:43,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:40:43,447 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:43,703 INFO L93 Difference]: Finished difference Result 39 states and 52 transitions. [2022-04-15 06:40:43,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 06:40:43,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-15 06:40:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:40:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 06:40:43,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-04-15 06:40:43,705 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-04-15 06:40:43,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:43,745 INFO L225 Difference]: With dead ends: 39 [2022-04-15 06:40:43,745 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 06:40:43,746 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-15 06:40:43,746 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:40:43,746 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 33 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:40:43,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 06:40:43,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2022-04-15 06:40:43,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:40:43,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:43,791 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:43,791 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:43,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:43,792 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-15 06:40:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-15 06:40:43,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:43,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:43,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:40:43,792 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 34 states. [2022-04-15 06:40:43,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:40:43,793 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions. [2022-04-15 06:40:43,793 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-04-15 06:40:43,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:40:43,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:40:43,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:40:43,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:40:43,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2022-04-15 06:40:43,794 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 20 [2022-04-15 06:40:43,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:40:43,794 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2022-04-15 06:40:43,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 06:40:43,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 40 transitions. [2022-04-15 06:40:43,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:40:43,931 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2022-04-15 06:40:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 06:40:43,931 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:40:43,931 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-15 06:40:43,947 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-15 06:40:44,132 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:44,132 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:40:44,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:40:44,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1695200847, now seen corresponding path program 1 times [2022-04-15 06:40:44,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:40:44,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2073645582] [2022-04-15 06:40:44,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:40:44,321 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:40:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2079281168, now seen corresponding path program 1 times [2022-04-15 06:40:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:40:44,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217976680] [2022-04-15 06:40:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:44,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:40:44,343 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.0))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:40:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:44,371 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_8.5))) (+ .cse0 main_~x~0_5 (* (- 4294967296) (div (+ .cse0 main_~x~0_5) 4294967296)))) 0)) [2022-04-15 06:40:44,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:40:44,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:44,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {2672#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {2657#true} is VALID [2022-04-15 06:40:44,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {2657#true} assume true; {2657#true} is VALID [2022-04-15 06:40:44,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2657#true} {2657#true} #83#return; {2657#true} is VALID [2022-04-15 06:40:44,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {2657#true} call ULTIMATE.init(); {2672#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:40:44,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#(and (= |#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(10, 2);call #Ultimate.allocInit(12, 3); {2657#true} is VALID [2022-04-15 06:40:44,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {2657#true} assume true; {2657#true} is VALID [2022-04-15 06:40:44,743 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2657#true} {2657#true} #83#return; {2657#true} is VALID [2022-04-15 06:40:44,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {2657#true} call #t~ret15 := main(); {2657#true} is VALID [2022-04-15 06:40:44,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {2657#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {2662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:40:44,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {2662#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [101] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= v_main_~y~0_51 v_main_~y~0_50)) (.cse1 (= v_main_~x~0_69 v_main_~x~0_68)) (.cse2 (= |v_main_#t~post5_29| |v_main_#t~post5_28|)) (.cse3 (mod v_main_~x~0_69 4294967296))) (or (and (= |v_main_#t~post6_29| |v_main_#t~post6_28|) .cse0 .cse1 .cse2) (and (= |v_main_#t~post6_28| |v_main_#t~post6_29|) .cse0 (<= .cse3 0) .cse1 .cse2) (and (forall ((v_it_8 Int)) (or (< 0 (mod (+ (* v_it_8 4294967295) v_main_~x~0_69) 4294967296)) (not (<= (+ v_main_~x~0_68 v_it_8 1) v_main_~x~0_69)) (not (<= 1 v_it_8)))) (= v_main_~y~0_50 (+ v_main_~x~0_69 v_main_~y~0_51 (* (- 1) v_main_~x~0_68))) (< v_main_~x~0_68 v_main_~x~0_69) (< 0 .cse3)))) InVars {main_~y~0=v_main_~y~0_51, main_#t~post5=|v_main_#t~post5_29|, main_~x~0=v_main_~x~0_69, main_#t~post6=|v_main_#t~post6_29|} OutVars{main_~y~0=v_main_~y~0_50, main_#t~post5=|v_main_#t~post5_28|, main_~x~0=v_main_~x~0_68, main_#t~post6=|v_main_#t~post6_28|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {2663#(or (and (<= (+ main_~y~0 main_~x~0) (+ (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0) 4294967296) 4294967296)))) (= main_~y~0 0))} is VALID [2022-04-15 06:40:44,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {2663#(or (and (<= (+ main_~y~0 main_~x~0) (+ (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295)) (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0) 4294967296) 4294967296)))) (= main_~y~0 0))} [100] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_2 4294967296))) InVars {main_~x~0=v_main_~x~0_2} OutVars{main_~x~0=v_main_~x~0_2} AuxVars[] AssignedVars[] {2664#(or (and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295))) (= main_~y~0 0))} is VALID [2022-04-15 06:40:44,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {2664#(or (and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ (* (div (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 4294967295))) (= main_~y~0 0))} ~z~0 := ~y~0; {2665#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))) (= main_~y~0 0)))} is VALID [2022-04-15 06:40:44,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {2665#(and (= (+ main_~z~0 (* (- 1) main_~y~0)) 0) (or (and (<= main_~n~0 (+ 4294967295 (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0) (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~y~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))) (<= main_~x~0 (* 4294967296 (div main_~x~0 4294967296)))) (= main_~y~0 0)))} assume !!(~z~0 % 4294967296 > 0);#t~post7 := ~x~0;~x~0 := 1 + #t~post7;havoc #t~post7;#t~post8 := ~z~0;~z~0 := #t~post8 - 1;havoc #t~post8; {2666#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 1)))} is VALID [2022-04-15 06:40:44,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {2666#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* 4294967296 (div (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (div main_~z~0 4294967296) (- 4294967296)) (* (- 1) main_~n~0)) 4294967296)) 1)))} assume !(~z~0 % 4294967296 > 0); {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:44,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} assume !!(~y~0 % 4294967296 > 0);#t~post9 := ~y~0;~y~0 := #t~post9 - 1;havoc #t~post9;#t~post10 := ~z~0;~z~0 := 1 + #t~post10;havoc #t~post10; {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:44,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} assume !(~y~0 % 4294967296 > 0); {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:44,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {2667#(and (<= (+ (* (div (+ (* (div (+ main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) 1) main_~x~0) (<= main_~x~0 (+ (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0)) 4294967296) 4294967296) 1)))} assume !!(~x~0 % 4294967296 > 0);#t~post11 := ~x~0;~x~0 := #t~post11 - 1;havoc #t~post11;#t~post12 := ~y~0;~y~0 := 1 + #t~post12;havoc #t~post12; {2668#(and (<= main_~x~0 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296)) (<= (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-15 06:40:44,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {2668#(and (<= main_~x~0 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296)) (<= (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) main_~x~0))} assume !(~x~0 % 4294967296 > 0); {2668#(and (<= main_~x~0 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296)) (<= (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) main_~x~0))} is VALID [2022-04-15 06:40:44,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {2668#(and (<= main_~x~0 (* (div (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) (* (- 1) main_~n~0) 1) 4294967296) 4294967296)) (<= (* (div (+ (* (div (+ (- 1) main_~n~0 (* (- 1) main_~x~0)) 4294967296) (- 4294967296)) main_~n~0) 4294967296) 4294967296) main_~x~0))} assume !!(~z~0 % 4294967296 > 0);#t~post13 := ~x~0;~x~0 := 1 + #t~post13;havoc #t~post13;#t~post14 := ~z~0;~z~0 := #t~post14 - 1;havoc #t~post14; {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:44,772 INFO L290 TraceCheckUtils]: 16: Hoare triple {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} assume !(~z~0 % 4294967296 > 0); {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} is VALID [2022-04-15 06:40:44,773 INFO L272 TraceCheckUtils]: 17: Hoare triple {2669#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {2670#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:40:44,773 INFO L290 TraceCheckUtils]: 18: Hoare triple {2670#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2671#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:40:44,774 INFO L290 TraceCheckUtils]: 19: Hoare triple {2671#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2658#false} is VALID [2022-04-15 06:40:44,774 INFO L290 TraceCheckUtils]: 20: Hoare triple {2658#false} assume !false; {2658#false} is VALID [2022-04-15 06:40:44,774 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 06:40:44,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:40:44,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217976680] [2022-04-15 06:40:44,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217976680] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:40:44,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939179604] [2022-04-15 06:40:44,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:40:44,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:40:44,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:40:44,776 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-15 06:40:44,777 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-15 06:40:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:44,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 06:40:44,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:40:44,956 INFO L286 TraceCheckSpWp]: Computing forward predicates...