/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-de20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 06:35:43,436 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 06:35:43,437 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 06:35:43,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 06:35:43,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 06:35:43,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 06:35:43,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 06:35:43,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 06:35:43,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 06:35:43,486 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 06:35:43,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 06:35:43,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 06:35:43,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 06:35:43,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 06:35:43,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 06:35:43,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 06:35:43,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 06:35:43,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 06:35:43,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 06:35:43,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 06:35:43,495 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 06:35:43,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 06:35:43,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 06:35:43,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 06:35:43,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 06:35:43,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 06:35:43,504 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 06:35:43,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 06:35:43,505 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 06:35:43,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 06:35:43,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 06:35:43,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 06:35:43,507 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 06:35:43,508 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 06:35:43,509 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 06:35:43,510 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 06:35:43,510 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 06:35:43,510 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 06:35:43,511 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 06:35:43,511 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 06:35:43,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 06:35:43,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 06:35:43,520 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:35:43,530 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 06:35:43,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 06:35:43,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 06:35:43,536 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 06:35:43,536 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 06:35:43,536 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 06:35:43,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 06:35:43,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 06:35:43,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 06:35:43,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 06:35:43,538 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 06:35:43,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 06:35:43,538 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 06:35:43,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 06:35:43,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 06:35:43,538 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 06:35:43,538 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 06:35:43,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 06:35:43,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:35:43,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 06:35:43,539 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 06:35:43,539 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 06:35:43,540 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 06:35:43,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 06:35:43,540 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 06:35:43,540 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:35:43,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 06:35:43,819 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 06:35:43,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 06:35:43,822 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 06:35:43,823 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 06:35:43,824 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-15 06:35:43,883 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb9d4ca7/461eb66cd2ec4c3b9c209cf47f6ba566/FLAGffcbec885 [2022-04-15 06:35:44,267 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 06:35:44,268 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/in-de20.c [2022-04-15 06:35:44,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb9d4ca7/461eb66cd2ec4c3b9c209cf47f6ba566/FLAGffcbec885 [2022-04-15 06:35:44,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ceb9d4ca7/461eb66cd2ec4c3b9c209cf47f6ba566 [2022-04-15 06:35:44,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 06:35:44,686 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 06:35:44,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 06:35:44,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 06:35:44,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 06:35:44,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:44,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3006bd66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44, skipping insertion in model container [2022-04-15 06:35:44,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:44,700 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 06:35:44,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 06:35:44,903 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-de20.c[368,381] [2022-04-15 06:35:44,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:35:44,934 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 06:35:44,944 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-de20.c[368,381] [2022-04-15 06:35:44,951 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 06:35:44,963 INFO L208 MainTranslator]: Completed translation [2022-04-15 06:35:44,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44 WrapperNode [2022-04-15 06:35:44,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 06:35:44,965 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 06:35:44,965 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 06:35:44,965 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 06:35:44,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:44,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:44,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:44,980 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:44,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:44,995 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:44,996 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:45,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 06:35:45,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 06:35:45,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 06:35:45,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 06:35:45,004 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44" (1/1) ... [2022-04-15 06:35:45,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 06:35:45,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:35:45,031 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:35:45,044 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:35:45,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 06:35:45,072 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 06:35:45,072 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 06:35:45,073 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 06:35:45,073 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 06:35:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 06:35:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 06:35:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 06:35:45,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 06:35:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 06:35:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 06:35:45,074 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 06:35:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 06:35:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 06:35:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 06:35:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 06:35:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 06:35:45,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 06:35:45,137 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 06:35:45,139 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 06:35:45,325 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 06:35:45,330 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 06:35:45,330 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 06:35:45,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:35:45 BoogieIcfgContainer [2022-04-15 06:35:45,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 06:35:45,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 06:35:45,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 06:35:45,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 06:35:45,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 06:35:44" (1/3) ... [2022-04-15 06:35:45,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f91f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:35:45, skipping insertion in model container [2022-04-15 06:35:45,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 06:35:44" (2/3) ... [2022-04-15 06:35:45,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59f91f5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 06:35:45, skipping insertion in model container [2022-04-15 06:35:45,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 06:35:45" (3/3) ... [2022-04-15 06:35:45,338 INFO L111 eAbstractionObserver]: Analyzing ICFG in-de20.c [2022-04-15 06:35:45,342 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 06:35:45,342 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 06:35:45,393 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 06:35:45,400 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:35:45,400 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 06:35:45,417 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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:35:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 06:35:45,423 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:35:45,423 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:35:45,424 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:35:45,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:35:45,430 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 1 times [2022-04-15 06:35:45,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:45,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1589154010] [2022-04-15 06:35:45,455 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 06:35:45,455 INFO L85 PathProgramCache]: Analyzing trace with hash 449096471, now seen corresponding path program 2 times [2022-04-15 06:35:45,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:35:45,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507037819] [2022-04-15 06:35:45,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:35:45,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:35:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:45,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:35:45,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:45,853 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); {24#true} is VALID [2022-04-15 06:35:45,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:35:45,854 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-15 06:35:45,856 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:35:45,856 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); {24#true} is VALID [2022-04-15 06:35:45,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-15 06:35:45,857 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #50#return; {24#true} is VALID [2022-04-15 06:35:45,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret9 := main(); {24#true} is VALID [2022-04-15 06:35:45,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:35:45,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~x~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:35:45,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} ~z~0 := ~y~0; {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:35:45,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} assume !(~z~0 % 4294967296 > 0); {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} is VALID [2022-04-15 06:35:45,864 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#(= 0 (+ main_~x~0 (* (- 1) main_~n~0)))} call __VERIFIER_assert((if ~x~0 % 4294967296 == ~n~0 % 4294967296 then 1 else 0)); {30#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:35:45,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {30#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {31#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:35:45,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {25#false} is VALID [2022-04-15 06:35:45,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-15 06:35:45,869 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:35:45,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:35:45,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507037819] [2022-04-15 06:35:45,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507037819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:35:45,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:35:45,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:35:45,873 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:35:45,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1589154010] [2022-04-15 06:35:45,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1589154010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:35:45,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:35:45,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 06:35:45,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162381654] [2022-04-15 06:35:45,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:35:45,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-15 06:35:45,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:35:45,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:35:45,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:45,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 06:35:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 06:35:45,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 06:35:45,935 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 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 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:35:46,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:46,281 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-04-15 06:35:46,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 06:35:46,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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 13 [2022-04-15 06:35:46,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:35:46,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:35:46,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 06:35:46,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:35:46,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 59 transitions. [2022-04-15 06:35:46,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 59 transitions. [2022-04-15 06:35:46,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:46,398 INFO L225 Difference]: With dead ends: 46 [2022-04-15 06:35:46,399 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:35:46,402 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:35:46,408 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:35:46,410 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 37 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:35:46,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:35:46,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 06:35:46,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:35:46,444 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:35:46,444 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:35:46,445 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:35:46,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:46,448 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:35:46,448 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:35:46,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:46,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:46,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:35:46,450 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:35:46,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:46,453 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:35:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:35:46,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:46,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:46,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:35:46,454 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:35:46,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 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:35:46,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 06:35:46,457 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 13 [2022-04-15 06:35:46,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:35:46,458 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 06:35:46,459 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 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:35:46,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 06:35:46,485 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:35:46,485 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:35:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:35:46,493 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:35:46,493 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:35:46,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 06:35:46,493 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:35:46,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:35:46,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1071583787, now seen corresponding path program 1 times [2022-04-15 06:35:46,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:46,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [488427041] [2022-04-15 06:35:47,702 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:35:47,705 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:35:47,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1959087468, now seen corresponding path program 1 times [2022-04-15 06:35:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:35:47,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218009059] [2022-04-15 06:35:47,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:35:47,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:35:47,735 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:35:47,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:47,790 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:35:47,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:35:47,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:47,954 INFO L290 TraceCheckUtils]: 0: Hoare triple {213#(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); {203#true} is VALID [2022-04-15 06:35:47,955 INFO L290 TraceCheckUtils]: 1: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-15 06:35:47,955 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-15 06:35:47,956 INFO L272 TraceCheckUtils]: 0: Hoare triple {203#true} call ULTIMATE.init(); {213#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:35:47,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {213#(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); {203#true} is VALID [2022-04-15 06:35:47,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {203#true} assume true; {203#true} is VALID [2022-04-15 06:35:47,956 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {203#true} {203#true} #50#return; {203#true} is VALID [2022-04-15 06:35:47,956 INFO L272 TraceCheckUtils]: 4: Hoare triple {203#true} call #t~ret9 := main(); {203#true} is VALID [2022-04-15 06:35:47,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {203#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {208#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:35:47,958 INFO L290 TraceCheckUtils]: 6: Hoare triple {208#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} assume !(~x~0 % 4294967296 > 0); {208#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:35:47,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {208#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} ~z~0 := ~y~0; {209#(and (= main_~z~0 0) (= 0 (+ main_~x~0 (* (- 1) main_~n~0))))} is VALID [2022-04-15 06:35:47,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {209#(and (= main_~z~0 0) (= 0 (+ main_~x~0 (* (- 1) main_~n~0))))} [54] L23-2-->L23-3_primed: Formula: (let ((.cse1 (= v_main_~z~0_7 v_main_~z~0_6)) (.cse2 (= |v_main_#t~post7_4| |v_main_#t~post7_3|)) (.cse3 (= |v_main_#t~post8_4| |v_main_#t~post8_3|)) (.cse4 (= v_main_~x~0_10 v_main_~x~0_9)) (.cse0 (mod v_main_~z~0_7 4294967296))) (or (and (forall ((v_it_1 Int)) (or (< 0 (mod (+ v_main_~z~0_7 (* v_it_1 4294967295)) 4294967296)) (not (<= (+ v_main_~x~0_10 v_it_1 1) v_main_~x~0_9)) (not (<= 1 v_it_1)))) (= v_main_~z~0_6 (+ v_main_~x~0_10 v_main_~z~0_7 (* (- 1) v_main_~x~0_9))) (< 0 .cse0) (< v_main_~x~0_10 v_main_~x~0_9)) (and .cse1 .cse2 .cse3 .cse4) (and .cse1 .cse2 .cse3 .cse4 (<= .cse0 0)))) InVars {main_~x~0=v_main_~x~0_10, main_#t~post8=|v_main_#t~post8_4|, main_~z~0=v_main_~z~0_7, main_#t~post7=|v_main_#t~post7_4|} OutVars{main_~x~0=v_main_~x~0_9, main_#t~post8=|v_main_#t~post8_3|, main_~z~0=v_main_~z~0_6, main_#t~post7=|v_main_#t~post7_3|} AuxVars[] AssignedVars[main_~x~0, main_~z~0, main_#t~post8, main_#t~post7] {210#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~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:35:47,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {210#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)))} [53] L23-3_primed-->L23-3: Formula: (not (< 0 (mod v_main_~z~0_2 4294967296))) InVars {main_~z~0=v_main_~z~0_2} OutVars{main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[] {210#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~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:35:47,962 INFO L272 TraceCheckUtils]: 10: Hoare triple {210#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= main_~x~0 main_~n~0) (< (+ 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)); {211#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:35:47,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {211#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {212#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:35:47,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {212#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {204#false} is VALID [2022-04-15 06:35:47,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {204#false} assume !false; {204#false} is VALID [2022-04-15 06:35:47,963 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:35:47,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:35:47,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218009059] [2022-04-15 06:35:47,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218009059] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:35:47,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:35:47,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:35:47,996 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:35:47,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [488427041] [2022-04-15 06:35:47,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [488427041] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:35:47,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:35:47,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 06:35:47,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906643991] [2022-04-15 06:35:47,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:35:47,998 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-15 06:35:47,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:35:47,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:35:48,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:48,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 06:35:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:48,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 06:35:48,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 06:35:48,013 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:35:48,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:48,179 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-15 06:35:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 06:35:48,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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 14 [2022-04-15 06:35:48,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:35:48,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:35:48,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-15 06:35:48,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:35:48,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-15 06:35:48,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-15 06:35:48,211 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:48,213 INFO L225 Difference]: With dead ends: 23 [2022-04-15 06:35:48,213 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 06:35:48,213 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-04-15 06:35:48,214 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 13 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:35:48,215 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 34 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 06:35:48,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 06:35:48,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 06:35:48,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:35:48,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:35:48,219 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:35:48,219 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:35:48,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:48,220 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:35:48,220 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:35:48,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:48,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:48,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-15 06:35:48,221 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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 15 states. [2022-04-15 06:35:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:48,222 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 06:35:48,222 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:35:48,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:48,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:48,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:35:48,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:35:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 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:35:48,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 06:35:48,225 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 14 [2022-04-15 06:35:48,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:35:48,225 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 06:35:48,225 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 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:35:48,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 06:35:48,244 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:35:48,244 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 06:35:48,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 06:35:48,245 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:35:48,245 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:35:48,245 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 06:35:48,246 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:35:48,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:35:48,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1025479988, now seen corresponding path program 1 times [2022-04-15 06:35:48,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:48,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [650868994] [2022-04-15 06:35:48,543 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:35:48,545 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:35:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash -2032929875, now seen corresponding path program 1 times [2022-04-15 06:35:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:35:48,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170030172] [2022-04-15 06:35:48,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:35:48,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:35:48,562 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:35:48,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:48,600 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_2.2))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:35:48,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:35:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:48,909 INFO L290 TraceCheckUtils]: 0: Hoare triple {338#(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); {326#true} is VALID [2022-04-15 06:35:48,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 06:35:48,911 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {326#true} {326#true} #50#return; {326#true} is VALID [2022-04-15 06:35:48,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {326#true} call ULTIMATE.init(); {338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:35:48,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {338#(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); {326#true} is VALID [2022-04-15 06:35:48,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} assume true; {326#true} is VALID [2022-04-15 06:35:48,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {326#true} {326#true} #50#return; {326#true} is VALID [2022-04-15 06:35:48,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {326#true} call #t~ret9 := main(); {326#true} is VALID [2022-04-15 06:35:48,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {331#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} is VALID [2022-04-15 06:35:48,923 INFO L290 TraceCheckUtils]: 6: Hoare triple {331#(and (= main_~n~0 main_~x~0) (= main_~y~0 0))} [56] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_4| |v_main_#t~post6_3|)) (.cse1 (= |v_main_#t~post5_4| |v_main_#t~post5_3|)) (.cse2 (= v_main_~x~0_17 v_main_~x~0_16)) (.cse3 (= v_main_~y~0_6 v_main_~y~0_5)) (.cse4 (mod v_main_~x~0_17 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (<= .cse4 0) .cse3) (and (< 0 .cse4) (< v_main_~y~0_6 v_main_~y~0_5) (forall ((v_it_2 Int)) (or (not (<= 1 v_it_2)) (< 0 (mod (+ v_main_~x~0_17 (* v_it_2 4294967295)) 4294967296)) (not (<= (+ v_main_~y~0_6 v_it_2 1) v_main_~y~0_5)))) (= v_main_~x~0_16 (+ v_main_~x~0_17 v_main_~y~0_6 (* (- 1) v_main_~y~0_5)))))) InVars {main_~y~0=v_main_~y~0_6, main_#t~post5=|v_main_#t~post5_4|, main_~x~0=v_main_~x~0_17, main_#t~post6=|v_main_#t~post6_4|} OutVars{main_~y~0=v_main_~y~0_5, main_#t~post5=|v_main_#t~post5_3|, main_~x~0=v_main_~x~0_16, main_#t~post6=|v_main_#t~post6_3|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {332#(or (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} is VALID [2022-04-15 06:35:48,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#(or (< (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296))) (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296) 1)) (<= (+ main_~y~0 main_~x~0) (+ (* 4294967296 (div (+ (- 1) main_~y~0 main_~x~0) 4294967296)) 4294967295)))} [55] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {333#(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))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} is VALID [2022-04-15 06:35:48,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {333#(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))) (<= (+ main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) (+ 4294967295 (* (div (+ (- 1) main_~y~0 (* 4294967296 (div main_~x~0 4294967296))) 4294967296) 4294967296))))} ~z~0 := ~y~0; {334#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (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:35:48,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {334#(or (<= (+ (* (div main_~z~0 4294967296) 4294967296) 1) main_~z~0) (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); {335#(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:35:48,931 INFO L272 TraceCheckUtils]: 10: Hoare triple {335#(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)); {336#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:35:48,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {336#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {337#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:35:48,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {337#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {327#false} is VALID [2022-04-15 06:35:48,936 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-04-15 06:35:48,937 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:35:48,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:35:48,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170030172] [2022-04-15 06:35:48,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170030172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:35:48,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:35:48,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:35:49,417 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:35:49,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [650868994] [2022-04-15 06:35:49,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [650868994] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:35:49,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:35:49,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 06:35:49,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813981013] [2022-04-15 06:35:49,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:35:49,419 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 14 [2022-04-15 06:35:49,419 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:35:49,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:35:49,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:35:49,448 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 06:35:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:49,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 06:35:49,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-04-15 06:35:49,449 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:35:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:49,859 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-04-15 06:35:49,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 06:35:49,859 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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 14 [2022-04-15 06:35:49,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:35:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:35:49,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2022-04-15 06:35:49,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:35:49,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2022-04-15 06:35:49,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 24 transitions. [2022-04-15 06:35:49,974 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:35:49,975 INFO L225 Difference]: With dead ends: 22 [2022-04-15 06:35:49,975 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 06:35:49,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-04-15 06:35:49,977 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 12 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 06:35:49,977 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 36 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 13 Unchecked, 0.1s Time] [2022-04-15 06:35:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 06:35:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-15 06:35:49,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:35:49,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:35:49,991 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:35:49,992 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:35:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:49,993 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:35:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:35:49,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:49,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:49,994 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:35:49,994 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:35:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:35:49,995 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-15 06:35:49,995 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 06:35:49,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:35:49,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:35:49,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:35:49,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:35:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 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:35:49,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-04-15 06:35:49,996 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2022-04-15 06:35:49,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:35:49,997 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-04-15 06:35:49,997 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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:35:49,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 17 transitions. [2022-04-15 06:35:50,353 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:35:50,354 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-04-15 06:35:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 06:35:50,354 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:35:50,354 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:35:50,354 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 06:35:50,354 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:35:50,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:35:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1690613482, now seen corresponding path program 1 times [2022-04-15 06:35:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:35:50,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [872339754] [2022-04-15 06:35:50,619 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:35:50,621 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 06:35:50,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1308890133, now seen corresponding path program 1 times [2022-04-15 06:35:50,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:35:50,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013390757] [2022-04-15 06:35:50,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:35:50,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:35:50,634 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.0))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:35:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:50,663 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (let ((.cse0 (* 4294967295 .v_it_3.5))) (+ main_~x~0_5 .cse0 (* (- 4294967296) (div (+ main_~x~0_5 .cse0) 4294967296)))) 0)) [2022-04-15 06:35:50,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:35:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:51,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {478#(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); {465#true} is VALID [2022-04-15 06:35:51,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-15 06:35:51,007 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2022-04-15 06:35:51,008 INFO L272 TraceCheckUtils]: 0: Hoare triple {465#true} call ULTIMATE.init(); {478#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:35:51,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {478#(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); {465#true} is VALID [2022-04-15 06:35:51,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {465#true} assume true; {465#true} is VALID [2022-04-15 06:35:51,008 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {465#true} {465#true} #50#return; {465#true} is VALID [2022-04-15 06:35:51,008 INFO L272 TraceCheckUtils]: 4: Hoare triple {465#true} call #t~ret9 := main(); {465#true} is VALID [2022-04-15 06:35:51,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {465#true} ~n~0 := #t~nondet4;havoc #t~nondet4;~x~0 := ~n~0;~y~0 := 0;havoc ~z~0; {470#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} is VALID [2022-04-15 06:35:51,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {470#(and (= 0 (+ main_~x~0 (* (- 1) main_~n~0))) (= main_~y~0 0))} [58] L16-2-->L16-3_primed: Formula: (let ((.cse0 (= |v_main_#t~post6_9| |v_main_#t~post6_8|)) (.cse1 (= |v_main_#t~post5_9| |v_main_#t~post5_8|)) (.cse2 (= v_main_~x~0_24 v_main_~x~0_23)) (.cse3 (= v_main_~y~0_13 v_main_~y~0_12)) (.cse4 (mod v_main_~x~0_24 4294967296))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 (<= .cse4 0) .cse2 .cse3) (and (< v_main_~x~0_23 v_main_~x~0_24) (forall ((v_it_3 Int)) (or (< 0 (mod (+ v_main_~x~0_24 (* v_it_3 4294967295)) 4294967296)) (not (<= 1 v_it_3)) (not (<= (+ v_main_~x~0_23 v_it_3 1) v_main_~x~0_24)))) (= (+ v_main_~x~0_24 v_main_~y~0_13 (* (- 1) v_main_~x~0_23)) v_main_~y~0_12) (< 0 .cse4)))) InVars {main_~y~0=v_main_~y~0_13, main_#t~post5=|v_main_#t~post5_9|, main_~x~0=v_main_~x~0_24, main_#t~post6=|v_main_#t~post6_9|} OutVars{main_~y~0=v_main_~y~0_12, main_#t~post5=|v_main_#t~post5_8|, main_~x~0=v_main_~x~0_23, main_#t~post6=|v_main_#t~post6_8|} AuxVars[] AssignedVars[main_~x~0, main_~y~0, main_#t~post5, main_#t~post6] {471#(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:35:51,553 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#(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))} [57] L16-3_primed-->L16-3: Formula: (not (< 0 (mod v_main_~x~0_4 4294967296))) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4} AuxVars[] AssignedVars[] {472#(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:35:51,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {472#(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; {473#(or (= main_~z~0 0) (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_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296)))))} is VALID [2022-04-15 06:35:51,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {473#(or (= main_~z~0 0) (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_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 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; {474#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} is VALID [2022-04-15 06:35:51,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {474#(and (<= (+ main_~x~0 (* (div main_~n~0 4294967296) 4294967296)) (+ main_~n~0 (* 4294967296 (div main_~x~0 4294967296)))) (<= (+ main_~n~0 (* (div main_~z~0 4294967296) 4294967296) (* 4294967296 (div main_~x~0 4294967296))) (+ main_~z~0 main_~x~0 (* (div main_~n~0 4294967296) 4294967296))))} assume !(~z~0 % 4294967296 > 0); {475#(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:35:51,563 INFO L272 TraceCheckUtils]: 11: Hoare triple {475#(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)); {476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 06:35:51,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {476#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {477#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 06:35:51,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {477#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {466#false} is VALID [2022-04-15 06:35:51,564 INFO L290 TraceCheckUtils]: 14: Hoare triple {466#false} assume !false; {466#false} is VALID [2022-04-15 06:35:51,564 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:35:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:35:51,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013390757] [2022-04-15 06:35:51,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013390757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:35:51,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375625275] [2022-04-15 06:35:51,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:35:51,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:35:51,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:35:51,571 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:35:51,599 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:35:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:51,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 06:35:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:35:51,828 INFO L286 TraceCheckSpWp]: Computing forward predicates...