/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/loop-acceleration/diamond_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:47:30,256 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:47:30,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:47:30,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:47:30,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:47:30,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:47:30,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:47:30,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:47:30,326 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:47:30,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:47:30,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:47:30,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:47:30,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:47:30,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:47:30,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:47:30,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:47:30,348 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:47:30,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:47:30,350 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:47:30,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:47:30,356 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:47:30,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:47:30,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:47:30,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:47:30,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:47:30,363 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:47:30,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:47:30,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:47:30,364 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:47:30,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:47:30,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:47:30,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:47:30,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:47:30,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:47:30,367 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:47:30,368 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:47:30,368 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:47:30,368 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:47:30,368 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:47:30,368 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:47:30,369 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:47:30,370 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:47:30,371 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:47:30,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:47:30,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:47:30,379 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:47:30,379 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:47:30,379 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:47:30,379 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:47:30,379 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:47:30,379 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:47:30,379 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:47:30,380 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:47:30,380 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:47:30,380 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:47:30,380 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:47:30,380 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:47:30,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:47:30,381 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:47:30,381 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:47:30,381 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:47:30,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:47:30,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:47:30,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:47:30,381 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:47:30,381 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:47:30,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:47:30,381 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:47:30,381 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-08 03:47:30,574 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:47:30,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:47:30,599 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:47:30,600 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:47:30,601 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:47:30,601 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2022-04-08 03:47:30,647 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ddb5473/91049cbf828c418fb82bb646c39c18a3/FLAG14c83651b [2022-04-08 03:47:31,013 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:47:31,014 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2022-04-08 03:47:31,018 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ddb5473/91049cbf828c418fb82bb646c39c18a3/FLAG14c83651b [2022-04-08 03:47:31,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1ddb5473/91049cbf828c418fb82bb646c39c18a3 [2022-04-08 03:47:31,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:47:31,035 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:47:31,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:47:31,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:47:31,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:47:31,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,042 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52e75e00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31, skipping insertion in model container [2022-04-08 03:47:31,042 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,046 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:47:31,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:47:31,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c[373,386] [2022-04-08 03:47:31,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:47:31,224 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:47:31,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c[373,386] [2022-04-08 03:47:31,242 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:47:31,251 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:47:31,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31 WrapperNode [2022-04-08 03:47:31,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:47:31,253 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:47:31,253 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:47:31,253 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:47:31,260 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,279 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:47:31,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:47:31,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:47:31,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:47:31,288 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31" (1/1) ... [2022-04-08 03:47:31,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:47:31,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:47:31,320 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-08 03:47:31,339 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-08 03:47:31,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:47:31,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:47:31,356 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:47:31,356 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:47:31,356 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:47:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:47:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:47:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:47:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:47:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 03:47:31,356 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:47:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:47:31,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:47:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:47:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:47:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:47:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:47:31,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:47:31,405 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:47:31,407 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:47:31,515 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:47:31,519 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:47:31,519 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:47:31,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:47:31 BoogieIcfgContainer [2022-04-08 03:47:31,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:47:31,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:47:31,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:47:31,524 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:47:31,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:47:31" (1/3) ... [2022-04-08 03:47:31,524 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0f57b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:47:31, skipping insertion in model container [2022-04-08 03:47:31,524 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:31" (2/3) ... [2022-04-08 03:47:31,525 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b0f57b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:47:31, skipping insertion in model container [2022-04-08 03:47:31,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:47:31" (3/3) ... [2022-04-08 03:47:31,525 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-2.c [2022-04-08 03:47:31,528 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:47:31,528 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:47:31,564 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:47:31,577 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-08 03:47:31,577 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:47:31,588 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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-08 03:47:31,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:47:31,592 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:31,593 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:31,593 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:31,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:31,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 1 times [2022-04-08 03:47:31,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:31,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [993664898] [2022-04-08 03:47:31,628 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:47:31,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 2 times [2022-04-08 03:47:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:31,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681147346] [2022-04-08 03:47:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:31,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:47:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:31,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(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(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-08 03:47:31,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 03:47:31,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-08 03:47:31,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:47:31,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(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(14, 2);call #Ultimate.allocInit(12, 3); {22#true} is VALID [2022-04-08 03:47:31,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-08 03:47:31,815 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-08 03:47:31,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret6 := main(); {22#true} is VALID [2022-04-08 03:47:31,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22#true} is VALID [2022-04-08 03:47:31,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-08 03:47:31,816 INFO L272 TraceCheckUtils]: 7: Hoare triple {23#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {23#false} is VALID [2022-04-08 03:47:31,816 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-08 03:47:31,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-08 03:47:31,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-08 03:47:31,817 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-08 03:47:31,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:47:31,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681147346] [2022-04-08 03:47:31,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681147346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:31,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:31,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:47:31,824 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:47:31,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [993664898] [2022-04-08 03:47:31,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [993664898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:31,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:31,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:47:31,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003285360] [2022-04-08 03:47:31,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:47:31,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 03:47:31,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:47:31,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:47:31,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:31,849 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:47:31,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:31,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:47:31,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:47:31,870 INFO L87 Difference]: Start difference. First operand has 19 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:47:31,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:31,944 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-08 03:47:31,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:47:31,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 03:47:31,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:47:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:47:31,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-08 03:47:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:47:31,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-08 03:47:31,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-08 03:47:32,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:32,036 INFO L225 Difference]: With dead ends: 30 [2022-04-08 03:47:32,036 INFO L226 Difference]: Without dead ends: 13 [2022-04-08 03:47:32,037 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:47:32,040 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 11 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:47:32,040 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:47:32,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-08 03:47:32,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-08 03:47:32,068 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:47:32,068 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-08 03:47:32,069 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-08 03:47:32,070 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-08 03:47:32,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:32,074 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-08 03:47:32,075 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-08 03:47:32,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:32,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:32,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 13 states. [2022-04-08 03:47:32,076 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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 13 states. [2022-04-08 03:47:32,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:32,078 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-08 03:47:32,078 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-08 03:47:32,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:32,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:32,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:47:32,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:47:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.25) internal successors, (10), 8 states have internal predecessors, (10), 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-08 03:47:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-08 03:47:32,081 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-08 03:47:32,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:47:32,082 INFO L478 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-08 03:47:32,082 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-08 03:47:32,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-08 03:47:32,098 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-08 03:47:32,099 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-08 03:47:32,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:47:32,101 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:32,105 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:32,105 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:47:32,106 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:32,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:32,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 1 times [2022-04-08 03:47:32,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:32,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [935418081] [2022-04-08 03:47:32,109 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:47:32,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 2 times [2022-04-08 03:47:32,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:32,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863235691] [2022-04-08 03:47:32,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:32,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:47:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:32,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {148#(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(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-08 03:47:32,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-08 03:47:32,233 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-08 03:47:32,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {142#true} call ULTIMATE.init(); {148#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:47:32,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {148#(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(14, 2);call #Ultimate.allocInit(12, 3); {142#true} is VALID [2022-04-08 03:47:32,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-08 03:47:32,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-08 03:47:32,235 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret6 := main(); {142#true} is VALID [2022-04-08 03:47:32,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {142#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {147#(= main_~x~0 0)} is VALID [2022-04-08 03:47:32,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {143#false} is VALID [2022-04-08 03:47:32,242 INFO L272 TraceCheckUtils]: 7: Hoare triple {143#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {143#false} is VALID [2022-04-08 03:47:32,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-08 03:47:32,242 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-08 03:47:32,242 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-08 03:47:32,242 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-08 03:47:32,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:47:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863235691] [2022-04-08 03:47:32,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863235691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:32,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:32,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:47:32,243 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:47:32,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [935418081] [2022-04-08 03:47:32,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [935418081] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:32,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:32,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:47:32,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465261473] [2022-04-08 03:47:32,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:47:32,245 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 03:47:32,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:47:32,245 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-08 03:47:32,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:32,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:47:32,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:32,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:47:32,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:47:32,257 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-08 03:47:32,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:32,305 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-08 03:47:32,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:47:32,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 03:47:32,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:47:32,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-08 03:47:32,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-08 03:47:32,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-08 03:47:32,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-08 03:47:32,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-08 03:47:32,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:32,329 INFO L225 Difference]: With dead ends: 20 [2022-04-08 03:47:32,329 INFO L226 Difference]: Without dead ends: 15 [2022-04-08 03:47:32,329 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:47:32,330 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:47:32,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:47:32,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-08 03:47:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-08 03:47:32,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:47:32,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 03:47:32,334 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 03:47:32,334 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 03:47:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:32,335 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-08 03:47:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-08 03:47:32,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:32,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:32,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 03:47:32,336 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 03:47:32,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:32,338 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-08 03:47:32,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-08 03:47:32,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:32,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:32,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:47:32,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:47:32,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 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-08 03:47:32,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-08 03:47:32,341 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-08 03:47:32,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:47:32,341 INFO L478 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-08 03:47:32,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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-08 03:47:32,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-08 03:47:32,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:32,355 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-08 03:47:32,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 03:47:32,355 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:32,355 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:32,355 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:47:32,356 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:32,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 1 times [2022-04-08 03:47:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:32,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [414433291] [2022-04-08 03:47:32,835 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:47:32,845 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 03:47:32,849 INFO L85 PathProgramCache]: Analyzing trace with hash -230057778, now seen corresponding path program 1 times [2022-04-08 03:47:32,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:32,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413287223] [2022-04-08 03:47:32,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:32,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:32,862 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_1.0) (* (- 1) main_~x~0_5) (* 4294967296 (div (+ (* 2 .v_it_1.0) main_~x~0_5) 4294967296)) 99) 0)) [2022-04-08 03:47:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-08 03:47:32,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1187903763] [2022-04-08 03:47:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:32,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:47:32,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:47:32,910 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-08 03:47:32,924 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-08 03:47:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:47:32,975 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 03:47:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:47:33,008 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 03:47:33,008 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 2 times [2022-04-08 03:47:33,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:33,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618268964] [2022-04-08 03:47:33,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:33,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:33,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:47:33,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:33,093 INFO L290 TraceCheckUtils]: 0: Hoare triple {258#(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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-08 03:47:33,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-08 03:47:33,094 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-08 03:47:33,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {258#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:47:33,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {258#(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(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-08 03:47:33,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-08 03:47:33,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-08 03:47:33,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-08 03:47:33,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {256#(= main_~x~0 0)} is VALID [2022-04-08 03:47:33,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {256#(= main_~x~0 0)} is VALID [2022-04-08 03:47:33,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {257#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-08 03:47:33,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {252#false} is VALID [2022-04-08 03:47:33,097 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {252#false} is VALID [2022-04-08 03:47:33,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-08 03:47:33,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-08 03:47:33,098 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-08 03:47:33,098 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-08 03:47:33,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:47:33,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618268964] [2022-04-08 03:47:33,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618268964] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:47:33,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248223416] [2022-04-08 03:47:33,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 03:47:33,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:47:33,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:47:33,116 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:47:33,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 03:47:33,160 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 03:47:33,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:47:33,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 03:47:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:33,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:47:33,242 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-08 03:47:33,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-08 03:47:33,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-08 03:47:33,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-08 03:47:33,243 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-08 03:47:33,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {256#(= main_~x~0 0)} is VALID [2022-04-08 03:47:33,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {256#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {256#(= main_~x~0 0)} is VALID [2022-04-08 03:47:33,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {256#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {283#(= (+ (- 2) main_~x~0) 0)} is VALID [2022-04-08 03:47:33,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#(= (+ (- 2) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 99); {252#false} is VALID [2022-04-08 03:47:33,247 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {252#false} is VALID [2022-04-08 03:47:33,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-08 03:47:33,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-08 03:47:33,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-08 03:47:33,249 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-08 03:47:33,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:47:33,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-08 03:47:33,310 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-08 03:47:33,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-08 03:47:33,310 INFO L272 TraceCheckUtils]: 9: Hoare triple {252#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {252#false} is VALID [2022-04-08 03:47:33,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {252#false} is VALID [2022-04-08 03:47:33,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {315#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {311#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-08 03:47:33,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {315#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {315#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-08 03:47:33,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {251#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {315#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-08 03:47:33,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-08 03:47:33,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-08 03:47:33,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-08 03:47:33,313 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {251#true} is VALID [2022-04-08 03:47:33,313 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-08 03:47:33,313 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-08 03:47:33,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248223416] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:47:33,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:47:33,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-08 03:47:33,314 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:47:33,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [414433291] [2022-04-08 03:47:33,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [414433291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:33,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:33,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 03:47:33,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099295301] [2022-04-08 03:47:33,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:47:33,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) 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-08 03:47:33,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:47:33,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) 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-08 03:47:33,326 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-08 03:47:33,326 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 03:47:33,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:33,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 03:47:33,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-08 03:47:33,328 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) 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-08 03:47:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:33,406 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-08 03:47:33,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 03:47:33,407 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) 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-08 03:47:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:47:33,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) 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-08 03:47:33,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-08 03:47:33,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) 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-08 03:47:33,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-08 03:47:33,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-08 03:47:33,436 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-08 03:47:33,437 INFO L225 Difference]: With dead ends: 22 [2022-04-08 03:47:33,437 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 03:47:33,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:47:33,447 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:47:33,448 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 18 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:47:33,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 03:47:33,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-08 03:47:33,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:47:33,458 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:47:33,458 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:47:33,458 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:47:33,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:33,459 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-08 03:47:33,459 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 03:47:33,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:33,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:33,460 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:47:33,460 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:47:33,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:33,461 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-08 03:47:33,461 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-08 03:47:33,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:33,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:33,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:47:33,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:47:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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-08 03:47:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-08 03:47:33,462 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-08 03:47:33,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:47:33,462 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-08 03:47:33,463 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) 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-08 03:47:33,463 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-08 03:47:33,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:33,484 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-08 03:47:33,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:47:33,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:33,484 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:33,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 03:47:33,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 03:47:33,887 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3,SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:47:33,888 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:33,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:33,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 3 times [2022-04-08 03:47:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:33,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1939373861] [2022-04-08 03:47:34,132 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 0 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:47:34,135 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-08 03:47:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash -170952434, now seen corresponding path program 1 times [2022-04-08 03:47:34,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:34,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569581288] [2022-04-08 03:47:34,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:34,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:34,156 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_2.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_2.0)) 4294967296)) 99) 0)) [2022-04-08 03:47:34,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-08 03:47:34,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1323212403] [2022-04-08 03:47:34,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:34,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:47:34,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:47:34,179 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:47:34,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 03:47:34,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:47:34,229 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 03:47:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 03:47:34,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 03:47:34,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 4 times [2022-04-08 03:47:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:34,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177980533] [2022-04-08 03:47:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:34,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:47:34,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:34,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {461#(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(14, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-08 03:47:34,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-08 03:47:34,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-08 03:47:34,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {461#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:47:34,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {461#(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(14, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-08 03:47:34,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-08 03:47:34,334 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-08 03:47:34,334 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret6 := main(); {453#true} is VALID [2022-04-08 03:47:34,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {458#(= main_~x~0 0)} is VALID [2022-04-08 03:47:34,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {458#(= main_~x~0 0)} is VALID [2022-04-08 03:47:34,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 03:47:34,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 03:47:34,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {460#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} is VALID [2022-04-08 03:47:34,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {460#(and (<= main_~x~0 4) (not (<= (+ (div main_~x~0 4294967296) 1) 0)))} assume !(~x~0 % 4294967296 < 99); {454#false} is VALID [2022-04-08 03:47:34,337 INFO L272 TraceCheckUtils]: 11: Hoare triple {454#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {454#false} is VALID [2022-04-08 03:47:34,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-08 03:47:34,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-08 03:47:34,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-08 03:47:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:47:34,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:47:34,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177980533] [2022-04-08 03:47:34,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177980533] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 03:47:34,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1133288338] [2022-04-08 03:47:34,338 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 03:47:34,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:47:34,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:47:34,340 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 03:47:34,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 03:47:34,365 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 03:47:34,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 03:47:34,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 03:47:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:34,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 03:47:34,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-08 03:47:34,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-08 03:47:34,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-08 03:47:34,539 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-08 03:47:34,539 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret6 := main(); {453#true} is VALID [2022-04-08 03:47:34,540 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {458#(= main_~x~0 0)} is VALID [2022-04-08 03:47:34,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {458#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {458#(= main_~x~0 0)} is VALID [2022-04-08 03:47:34,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {458#(= main_~x~0 0)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 03:47:34,541 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-08 03:47:34,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {492#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-08 03:47:34,542 INFO L290 TraceCheckUtils]: 10: Hoare triple {492#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !(~x~0 % 4294967296 < 99); {454#false} is VALID [2022-04-08 03:47:34,543 INFO L272 TraceCheckUtils]: 11: Hoare triple {454#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {454#false} is VALID [2022-04-08 03:47:34,543 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-08 03:47:34,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-08 03:47:34,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-08 03:47:34,543 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:47:34,543 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 03:47:34,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-08 03:47:34,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-08 03:47:34,620 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-08 03:47:34,621 INFO L272 TraceCheckUtils]: 11: Hoare triple {454#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296 then 1 else 0)); {454#false} is VALID [2022-04-08 03:47:34,622 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {454#false} is VALID [2022-04-08 03:47:34,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {524#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {520#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-08 03:47:34,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {524#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {524#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-08 03:47:34,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {531#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !(0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296);~x~0 := 2 + ~x~0; {524#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-08 03:47:34,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {531#(< (mod (+ main_~x~0 4) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {531#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-08 03:47:34,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {453#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {531#(< (mod (+ main_~x~0 4) 4294967296) 99)} is VALID [2022-04-08 03:47:34,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret6 := main(); {453#true} is VALID [2022-04-08 03:47:34,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-08 03:47:34,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-08 03:47:34,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2);call #Ultimate.allocInit(12, 3); {453#true} is VALID [2022-04-08 03:47:34,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-08 03:47:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:47:34,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1133288338] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 03:47:34,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-08 03:47:34,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-08 03:47:34,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:47:34,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1939373861] [2022-04-08 03:47:34,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1939373861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:34,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:34,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:47:34,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309639482] [2022-04-08 03:47:34,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:47:34,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-08 03:47:34,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:47:34,628 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 03:47:34,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:34,640 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:47:34,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:34,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:47:34,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:47:34,641 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 03:47:34,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:34,761 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-08 03:47:34,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 03:47:34,762 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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 15 [2022-04-08 03:47:34,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:47:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 03:47:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 03:47:34,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 03:47:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-08 03:47:34,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-08 03:47:34,792 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:34,793 INFO L225 Difference]: With dead ends: 25 [2022-04-08 03:47:34,793 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 03:47:34,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-08 03:47:34,795 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:47:34,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 18 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:47:34,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 03:47:34,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-08 03:47:34,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:47:34,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:34,809 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:34,809 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:34,811 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-08 03:47:34,811 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-08 03:47:34,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:34,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:34,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 03:47:34,812 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 20 states. [2022-04-08 03:47:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:34,813 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-08 03:47:34,813 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-08 03:47:34,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:34,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:34,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:47:34,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:47:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-08 03:47:34,816 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-08 03:47:34,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:47:34,816 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-08 03:47:34,817 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 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-08 03:47:34,817 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-08 03:47:34,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-08 03:47:34,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 03:47:34,836 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:34,837 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:34,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 03:47:35,055 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-08 03:47:35,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 03:47:35,252 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:35,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1978535968, now seen corresponding path program 1 times [2022-04-08 03:47:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:35,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [382810267] [2022-04-08 03:47:35,968 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 03:47:35,970 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post5_4|] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 03:47:35,973 INFO L158 Benchmark]: Toolchain (without parser) took 4938.33ms. Allocated memory was 187.7MB in the beginning and 280.0MB in the end (delta: 92.3MB). Free memory was 138.8MB in the beginning and 124.5MB in the end (delta: 14.3MB). Peak memory consumption was 106.4MB. Max. memory is 8.0GB. [2022-04-08 03:47:35,973 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:47:35,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.22ms. Allocated memory is still 187.7MB. Free memory was 138.6MB in the beginning and 163.3MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 03:47:35,974 INFO L158 Benchmark]: Boogie Preprocessor took 33.43ms. Allocated memory is still 187.7MB. Free memory was 163.3MB in the beginning and 161.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:47:35,974 INFO L158 Benchmark]: RCFGBuilder took 233.60ms. Allocated memory is still 187.7MB. Free memory was 161.7MB in the beginning and 151.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-08 03:47:35,974 INFO L158 Benchmark]: TraceAbstraction took 4450.90ms. Allocated memory was 187.7MB in the beginning and 280.0MB in the end (delta: 92.3MB). Free memory was 150.7MB in the beginning and 124.5MB in the end (delta: 26.3MB). Peak memory consumption was 119.6MB. Max. memory is 8.0GB. [2022-04-08 03:47:35,975 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 187.7MB. Free memory is still 155.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 215.22ms. Allocated memory is still 187.7MB. Free memory was 138.6MB in the beginning and 163.3MB in the end (delta: -24.7MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.43ms. Allocated memory is still 187.7MB. Free memory was 163.3MB in the beginning and 161.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 233.60ms. Allocated memory is still 187.7MB. Free memory was 161.7MB in the beginning and 151.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 4450.90ms. Allocated memory was 187.7MB in the beginning and 280.0MB in the end (delta: 92.3MB). Free memory was 150.7MB in the beginning and 124.5MB in the end (delta: 26.3MB). Peak memory consumption was 119.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post5_4|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post5_4|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 03:47:35,986 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...