/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-fb4f59a-m [2022-04-28 02:56:27,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 02:56:27,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 02:56:27,415 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 02:56:27,415 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 02:56:27,417 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 02:56:27,419 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 02:56:27,421 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 02:56:27,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 02:56:27,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 02:56:27,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 02:56:27,428 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 02:56:27,428 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 02:56:27,430 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 02:56:27,431 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 02:56:27,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 02:56:27,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 02:56:27,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 02:56:27,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 02:56:27,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 02:56:27,449 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 02:56:27,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 02:56:27,450 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 02:56:27,450 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 02:56:27,451 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 02:56:27,452 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 02:56:27,452 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 02:56:27,452 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 02:56:27,453 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 02:56:27,453 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 02:56:27,454 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 02:56:27,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 02:56:27,454 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 02:56:27,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 02:56:27,458 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 02:56:27,459 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 02:56:27,459 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 02:56:27,460 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 02:56:27,460 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 02:56:27,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 02:56:27,460 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 02:56:27,461 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 02:56:27,462 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 02:56:27,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 02:56:27,468 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 02:56:27,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 02:56:27,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 02:56:27,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 02:56:27,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 02:56:27,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 02:56:27,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 02:56:27,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 02:56:27,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 02:56:27,470 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 02:56:27,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 02:56:27,470 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 02:56:27,470 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 02:56:27,470 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 02:56:27,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 02:56:27,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 02:56:27,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 02:56:27,471 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:27,471 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 02:56:27,471 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 02:56:27,471 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 02:56:27,471 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 02:56:27,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 02:56:27,471 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 02:56:27,471 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-28 02:56:27,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 02:56:27,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 02:56:27,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 02:56:27,709 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 02:56:27,711 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 02:56:27,712 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-28 02:56:27,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f005218/b578e4cbb7af446992209849e5f09160/FLAG4b1f60a2a [2022-04-28 02:56:28,093 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 02:56:28,094 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/diamond_1-2.c [2022-04-28 02:56:28,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f005218/b578e4cbb7af446992209849e5f09160/FLAG4b1f60a2a [2022-04-28 02:56:28,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3f005218/b578e4cbb7af446992209849e5f09160 [2022-04-28 02:56:28,108 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 02:56:28,109 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 02:56:28,111 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:28,111 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 02:56:28,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 02:56:28,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cfe066e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28, skipping insertion in model container [2022-04-28 02:56:28,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 02:56:28,129 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 02:56:28,247 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-28 02:56:28,258 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:28,273 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 02:56:28,280 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-28 02:56:28,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 02:56:28,291 INFO L208 MainTranslator]: Completed translation [2022-04-28 02:56:28,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28 WrapperNode [2022-04-28 02:56:28,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 02:56:28,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 02:56:28,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 02:56:28,292 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 02:56:28,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 02:56:28,314 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 02:56:28,314 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 02:56:28,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 02:56:28,315 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28" (1/1) ... [2022-04-28 02:56:28,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 02:56:28,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:28,337 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-28 02:56:28,345 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-28 02:56:28,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 02:56:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 02:56:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 02:56:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 02:56:28,364 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 02:56:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 02:56:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 02:56:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 02:56:28,365 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 02:56:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 02:56:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 02:56:28,366 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 02:56:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 02:56:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 02:56:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 02:56:28,367 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 02:56:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 02:56:28,368 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 02:56:28,410 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 02:56:28,411 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 02:56:28,547 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 02:56:28,552 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 02:56:28,552 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 02:56:28,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:28 BoogieIcfgContainer [2022-04-28 02:56:28,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 02:56:28,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 02:56:28,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 02:56:28,573 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 02:56:28,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 02:56:28" (1/3) ... [2022-04-28 02:56:28,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a605b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:28, skipping insertion in model container [2022-04-28 02:56:28,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 02:56:28" (2/3) ... [2022-04-28 02:56:28,574 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a605b47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 02:56:28, skipping insertion in model container [2022-04-28 02:56:28,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 02:56:28" (3/3) ... [2022-04-28 02:56:28,575 INFO L111 eAbstractionObserver]: Analyzing ICFG diamond_1-2.c [2022-04-28 02:56:28,585 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 02:56:28,585 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 02:56:28,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 02:56:28,670 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c8c1c69, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2e868596 [2022-04-28 02:56:28,670 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 02:56:28,690 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-28 02:56:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:56:28,694 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:28,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:28,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:28,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:28,699 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 1 times [2022-04-28 02:56:28,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:28,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [167641329] [2022-04-28 02:56:28,715 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:28,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1418018830, now seen corresponding path program 2 times [2022-04-28 02:56:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:28,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633320921] [2022-04-28 02:56:28,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:28,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:28,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:28,884 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-28 02:56:28,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 02:56:28,885 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-28 02:56:28,890 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-28 02:56:28,890 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-28 02:56:28,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume true; {22#true} is VALID [2022-04-28 02:56:28,891 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22#true} {22#true} #42#return; {22#true} is VALID [2022-04-28 02:56:28,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {22#true} call #t~ret6 := main(); {22#true} is VALID [2022-04-28 02:56:28,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {22#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {22#true} is VALID [2022-04-28 02:56:28,892 INFO L290 TraceCheckUtils]: 6: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-04-28 02:56:28,892 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-28 02:56:28,892 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2022-04-28 02:56:28,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2022-04-28 02:56:28,893 INFO L290 TraceCheckUtils]: 10: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-04-28 02:56:28,893 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-28 02:56:28,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:28,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633320921] [2022-04-28 02:56:28,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633320921] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:28,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:28,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:28,898 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:28,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [167641329] [2022-04-28 02:56:28,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [167641329] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:28,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:28,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 02:56:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91755746] [2022-04-28 02:56:28,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:28,903 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-28 02:56:28,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:28,906 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-28 02:56:28,923 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-28 02:56:28,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 02:56:28,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:28,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 02:56:28,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 02:56:28,944 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-28 02:56:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:29,029 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:56:29,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 02:56:29,030 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-28 02:56:29,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:29,031 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-28 02:56:29,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 02:56:29,036 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-28 02:56:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2022-04-28 02:56:29,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2022-04-28 02:56:29,085 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-28 02:56:29,090 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:56:29,091 INFO L226 Difference]: Without dead ends: 13 [2022-04-28 02:56:29,093 INFO L412 NwaCegarLoop]: 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-28 02:56:29,097 INFO L413 NwaCegarLoop]: 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-28 02:56:29,098 INFO L414 NwaCegarLoop]: 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-28 02:56:29,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-28 02:56:29,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-04-28 02:56:29,124 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:29,124 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-28 02:56:29,126 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-28 02:56:29,127 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-28 02:56:29,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:29,134 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 02:56:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 02:56:29,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:29,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:29,135 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-28 02:56:29,136 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-28 02:56:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:29,139 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2022-04-28 02:56:29,139 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 02:56:29,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:29,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:29,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:29,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:29,140 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-28 02:56:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-04-28 02:56:29,143 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 11 [2022-04-28 02:56:29,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:29,143 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-04-28 02:56:29,144 INFO L496 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-28 02:56:29,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 14 transitions. [2022-04-28 02:56:29,160 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-28 02:56:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-04-28 02:56:29,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 02:56:29,163 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:29,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:29,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 02:56:29,168 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:29,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:29,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 1 times [2022-04-28 02:56:29,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:29,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1012368750] [2022-04-28 02:56:29,173 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 02:56:29,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1427254040, now seen corresponding path program 2 times [2022-04-28 02:56:29,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:29,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430346493] [2022-04-28 02:56:29,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:29,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:29,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:29,314 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-28 02:56:29,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 02:56:29,316 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-28 02:56:29,316 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-28 02:56:29,317 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-28 02:56:29,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {142#true} assume true; {142#true} is VALID [2022-04-28 02:56:29,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {142#true} {142#true} #42#return; {142#true} is VALID [2022-04-28 02:56:29,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {142#true} call #t~ret6 := main(); {142#true} is VALID [2022-04-28 02:56:29,318 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-28 02:56:29,318 INFO L290 TraceCheckUtils]: 6: Hoare triple {147#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 99); {143#false} is VALID [2022-04-28 02:56:29,319 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-28 02:56:29,319 INFO L290 TraceCheckUtils]: 8: Hoare triple {143#false} ~cond := #in~cond; {143#false} is VALID [2022-04-28 02:56:29,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {143#false} assume 0 == ~cond; {143#false} is VALID [2022-04-28 02:56:29,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {143#false} assume !false; {143#false} is VALID [2022-04-28 02:56:29,319 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-28 02:56:29,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:29,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430346493] [2022-04-28 02:56:29,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430346493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:29,320 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:29,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:29,320 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:29,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1012368750] [2022-04-28 02:56:29,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1012368750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:29,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:29,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:29,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728748664] [2022-04-28 02:56:29,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:29,322 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-28 02:56:29,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:29,322 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-28 02:56:29,334 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-28 02:56:29,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:56:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:29,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:56:29,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:56:29,336 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-28 02:56:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:29,399 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-04-28 02:56:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:56:29,400 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-28 02:56:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:29,400 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-28 02:56:29,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-28 02:56:29,407 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-28 02:56:29,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-28 02:56:29,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-28 02:56:29,428 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-28 02:56:29,431 INFO L225 Difference]: With dead ends: 20 [2022-04-28 02:56:29,431 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 02:56:29,431 INFO L412 NwaCegarLoop]: 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-28 02:56:29,433 INFO L413 NwaCegarLoop]: 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-28 02:56:29,434 INFO L414 NwaCegarLoop]: 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-28 02:56:29,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 02:56:29,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2022-04-28 02:56:29,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:29,440 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-28 02:56:29,440 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-28 02:56:29,440 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-28 02:56:29,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:29,442 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 02:56:29,442 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 02:56:29,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:29,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:29,443 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-28 02:56:29,443 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-28 02:56:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:29,444 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 02:56:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 02:56:29,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:29,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:29,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:29,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:29,445 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-28 02:56:29,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 02:56:29,446 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 11 [2022-04-28 02:56:29,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:29,446 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 02:56:29,447 INFO L496 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-28 02:56:29,447 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 02:56:29,460 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-28 02:56:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 02:56:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-28 02:56:29,461 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:29,461 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:29,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 02:56:29,463 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:29,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:29,464 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 1 times [2022-04-28 02:56:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:29,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [888663541] [2022-04-28 02:56:29,944 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-28 02:56:29,948 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:29,952 INFO L85 PathProgramCache]: Analyzing trace with hash -230057778, now seen corresponding path program 1 times [2022-04-28 02:56:29,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:29,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878692544] [2022-04-28 02:56:29,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:29,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:29,967 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-28 02:56:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 02:56:30,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339125628] [2022-04-28 02:56:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:30,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:30,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:30,027 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-28 02:56:30,028 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-28 02:56:30,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:30,084 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:30,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:30,119 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:30,119 INFO L85 PathProgramCache]: Analyzing trace with hash -397340509, now seen corresponding path program 2 times [2022-04-28 02:56:30,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:30,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444157417] [2022-04-28 02:56:30,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:30,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:30,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:30,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:30,200 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-28 02:56:30,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 02:56:30,200 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 02:56:30,201 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-28 02:56:30,201 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-28 02:56:30,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 02:56:30,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 02:56:30,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-28 02:56:30,202 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-28 02:56:30,202 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-28 02:56:30,203 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-28 02:56:30,203 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-28 02:56:30,203 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-28 02:56:30,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-28 02:56:30,204 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-28 02:56:30,204 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-28 02:56:30,204 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-28 02:56:30,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:30,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444157417] [2022-04-28 02:56:30,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444157417] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:30,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2075285029] [2022-04-28 02:56:30,204 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:30,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:30,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:30,206 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-28 02:56:30,207 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-28 02:56:30,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:30,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:30,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 02:56:30,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:30,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:30,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-28 02:56:30,323 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-28 02:56:30,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 02:56:30,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 02:56:30,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-28 02:56:30,327 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-28 02:56:30,328 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-28 02:56:30,328 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-28 02:56:30,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {283#(= (+ (- 2) main_~x~0) 0)} assume !(~x~0 % 4294967296 < 99); {252#false} is VALID [2022-04-28 02:56:30,330 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-28 02:56:30,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-28 02:56:30,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-28 02:56:30,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-28 02:56:30,331 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-28 02:56:30,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:30,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {252#false} assume !false; {252#false} is VALID [2022-04-28 02:56:30,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {252#false} assume 0 == ~cond; {252#false} is VALID [2022-04-28 02:56:30,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2022-04-28 02:56:30,387 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-28 02:56:30,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {311#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {252#false} is VALID [2022-04-28 02:56:30,388 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-28 02:56:30,389 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-28 02:56:30,389 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-28 02:56:30,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret6 := main(); {251#true} is VALID [2022-04-28 02:56:30,390 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #42#return; {251#true} is VALID [2022-04-28 02:56:30,390 INFO L290 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2022-04-28 02:56:30,390 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-28 02:56:30,390 INFO L272 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2022-04-28 02:56:30,390 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-28 02:56:30,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2075285029] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:30,390 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:30,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-28 02:56:30,391 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:30,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [888663541] [2022-04-28 02:56:30,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [888663541] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:30,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:30,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 02:56:30,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7594137] [2022-04-28 02:56:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:30,391 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-28 02:56:30,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:30,392 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-28 02:56:30,400 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-28 02:56:30,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 02:56:30,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:30,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 02:56:30,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-28 02:56:30,401 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-28 02:56:30,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:30,466 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-04-28 02:56:30,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 02:56:30,466 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-28 02:56:30,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:30,467 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-28 02:56:30,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 02:56:30,468 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-28 02:56:30,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2022-04-28 02:56:30,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2022-04-28 02:56:30,489 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-28 02:56:30,490 INFO L225 Difference]: With dead ends: 22 [2022-04-28 02:56:30,490 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 02:56:30,490 INFO L412 NwaCegarLoop]: 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-28 02:56:30,495 INFO L413 NwaCegarLoop]: 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-28 02:56:30,496 INFO L414 NwaCegarLoop]: 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-28 02:56:30,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 02:56:30,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2022-04-28 02:56:30,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:30,506 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-28 02:56:30,506 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-28 02:56:30,506 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-28 02:56:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:30,508 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 02:56:30,508 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 02:56:30,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:30,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:30,508 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-28 02:56:30,509 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-28 02:56:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:30,511 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-04-28 02:56:30,511 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-04-28 02:56:30,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:30,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:30,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:30,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:30,512 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-28 02:56:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 02:56:30,513 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-04-28 02:56:30,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:30,514 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 02:56:30,516 INFO L496 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-28 02:56:30,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 02:56:30,546 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-28 02:56:30,546 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 02:56:30,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:56:30,546 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:30,546 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:30,564 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-28 02:56:30,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:30,956 WARN L477 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-28 02:56:30,957 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:30,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:30,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 3 times [2022-04-28 02:56:30,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:30,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849755177] [2022-04-28 02:56:31,199 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-28 02:56:31,200 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:31,203 INFO L85 PathProgramCache]: Analyzing trace with hash -170952434, now seen corresponding path program 1 times [2022-04-28 02:56:31,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:31,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633687447] [2022-04-28 02:56:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:31,211 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-28 02:56:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 02:56:31,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456968760] [2022-04-28 02:56:31,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:31,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:31,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:31,237 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-28 02:56:31,251 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-28 02:56:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:31,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:31,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:31,307 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1507084702, now seen corresponding path program 4 times [2022-04-28 02:56:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:31,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265435136] [2022-04-28 02:56:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:31,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:31,387 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-28 02:56:31,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-28 02:56:31,388 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-28 02:56:31,389 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-28 02:56:31,389 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-28 02:56:31,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-28 02:56:31,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-28 02:56:31,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret6 := main(); {453#true} is VALID [2022-04-28 02:56:31,389 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-28 02:56:31,390 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-28 02:56:31,390 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-28 02:56:31,391 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-28 02:56:31,391 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-28 02:56:31,392 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-28 02:56:31,392 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-28 02:56:31,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-28 02:56:31,392 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-28 02:56:31,392 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-28 02:56:31,392 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-28 02:56:31,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:31,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265435136] [2022-04-28 02:56:31,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265435136] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:31,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239070055] [2022-04-28 02:56:31,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 02:56:31,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:31,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:31,394 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-28 02:56:31,395 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-28 02:56:31,423 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 02:56:31,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:31,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:56:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:31,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:31,606 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-28 02:56:31,607 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-28 02:56:31,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-28 02:56:31,608 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-28 02:56:31,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret6 := main(); {453#true} is VALID [2022-04-28 02:56:31,608 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-28 02:56:31,609 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-28 02:56:31,609 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-28 02:56:31,610 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-28 02:56:31,610 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-28 02:56:31,611 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-28 02:56:31,611 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-28 02:56:31,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-28 02:56:31,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-28 02:56:31,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-28 02:56:31,614 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-28 02:56:31,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:31,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {454#false} assume !false; {454#false} is VALID [2022-04-28 02:56:31,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {454#false} assume 0 == ~cond; {454#false} is VALID [2022-04-28 02:56:31,688 INFO L290 TraceCheckUtils]: 12: Hoare triple {454#false} ~cond := #in~cond; {454#false} is VALID [2022-04-28 02:56:31,689 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-28 02:56:31,689 INFO L290 TraceCheckUtils]: 10: Hoare triple {520#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {454#false} is VALID [2022-04-28 02:56:31,690 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-28 02:56:31,690 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-28 02:56:31,691 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-28 02:56:31,691 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-28 02:56:31,692 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-28 02:56:31,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {453#true} call #t~ret6 := main(); {453#true} is VALID [2022-04-28 02:56:31,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {453#true} {453#true} #42#return; {453#true} is VALID [2022-04-28 02:56:31,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {453#true} assume true; {453#true} is VALID [2022-04-28 02:56:31,693 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-28 02:56:31,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {453#true} call ULTIMATE.init(); {453#true} is VALID [2022-04-28 02:56:31,693 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-28 02:56:31,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239070055] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:31,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:31,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 02:56:31,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:31,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849755177] [2022-04-28 02:56:31,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849755177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:31,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:31,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:56:31,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28902374] [2022-04-28 02:56:31,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:31,694 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-28 02:56:31,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:31,694 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-28 02:56:31,705 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-28 02:56:31,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:56:31,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:31,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:56:31,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:56:31,706 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-28 02:56:31,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:31,811 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 02:56:31,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:56:31,811 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-28 02:56:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:31,811 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-28 02:56:31,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 02:56:31,812 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-28 02:56:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2022-04-28 02:56:31,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 28 transitions. [2022-04-28 02:56:31,837 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-28 02:56:31,838 INFO L225 Difference]: With dead ends: 25 [2022-04-28 02:56:31,838 INFO L226 Difference]: Without dead ends: 20 [2022-04-28 02:56:31,838 INFO L412 NwaCegarLoop]: 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-28 02:56:31,839 INFO L413 NwaCegarLoop]: 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-28 02:56:31,839 INFO L414 NwaCegarLoop]: 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-28 02:56:31,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-28 02:56:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-28 02:56:31,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:31,850 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-28 02:56:31,850 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-28 02:56:31,850 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-28 02:56:31,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:31,851 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-28 02:56:31,851 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 02:56:31,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:31,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:31,852 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-28 02:56:31,852 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-28 02:56:31,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:31,853 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2022-04-28 02:56:31,853 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-04-28 02:56:31,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:31,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:31,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:31,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:31,853 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-28 02:56:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2022-04-28 02:56:31,854 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 15 [2022-04-28 02:56:31,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:31,854 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2022-04-28 02:56:31,854 INFO L496 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-28 02:56:31,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 21 transitions. [2022-04-28 02:56:31,874 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-28 02:56:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2022-04-28 02:56:31,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:56:31,875 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:31,875 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:31,894 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-28 02:56:32,092 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-28 02:56:32,289 WARN L477 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-28 02:56:32,289 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:32,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:32,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1978535968, now seen corresponding path program 1 times [2022-04-28 02:56:32,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:32,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [127187913] [2022-04-28 02:56:32,989 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-28 02:56:33,614 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-28 02:56:33,616 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash 2055943693, now seen corresponding path program 1 times [2022-04-28 02:56:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:33,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862486873] [2022-04-28 02:56:33,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:33,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:33,636 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 2) .v_it_4.0) (* (- 1) main_~x~0_6) (* 4294967296 (div (+ (* 2 .v_it_4.0) main_~x~0_6) 4294967296)) 99) 0)) [2022-04-28 02:56:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 02:56:33,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [548918187] [2022-04-28 02:56:33,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:33,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:33,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:33,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:33,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 02:56:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:33,689 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:33,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:33,699 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:33,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1978535968, now seen corresponding path program 2 times [2022-04-28 02:56:33,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:33,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111222867] [2022-04-28 02:56:33,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:33,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:33,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {693#(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); {687#true} is VALID [2022-04-28 02:56:33,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-28 02:56:33,737 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {687#true} {687#true} #42#return; {687#true} is VALID [2022-04-28 02:56:33,738 INFO L272 TraceCheckUtils]: 0: Hoare triple {687#true} call ULTIMATE.init(); {693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:33,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {693#(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); {687#true} is VALID [2022-04-28 02:56:33,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {687#true} assume true; {687#true} is VALID [2022-04-28 02:56:33,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {687#true} {687#true} #42#return; {687#true} is VALID [2022-04-28 02:56:33,738 INFO L272 TraceCheckUtils]: 4: Hoare triple {687#true} call #t~ret6 := main(); {687#true} is VALID [2022-04-28 02:56:33,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {687#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {687#true} is VALID [2022-04-28 02:56:33,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {687#true} assume !!(~x~0 % 4294967296 < 99); {687#true} is VALID [2022-04-28 02:56:33,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {687#true} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {692#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-28 02:56:33,746 INFO L290 TraceCheckUtils]: 8: Hoare triple {692#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} assume !!(~x~0 % 4294967296 < 99); {692#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~0) 0)} is VALID [2022-04-28 02:56:33,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {692#(= (+ (* (- 2) (div main_~y~0 2)) main_~y~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; {688#false} is VALID [2022-04-28 02:56:33,747 INFO L290 TraceCheckUtils]: 10: Hoare triple {688#false} assume !(~x~0 % 4294967296 < 99); {688#false} is VALID [2022-04-28 02:56:33,747 INFO L272 TraceCheckUtils]: 11: Hoare triple {688#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)); {688#false} is VALID [2022-04-28 02:56:33,747 INFO L290 TraceCheckUtils]: 12: Hoare triple {688#false} ~cond := #in~cond; {688#false} is VALID [2022-04-28 02:56:33,747 INFO L290 TraceCheckUtils]: 13: Hoare triple {688#false} assume 0 == ~cond; {688#false} is VALID [2022-04-28 02:56:33,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {688#false} assume !false; {688#false} is VALID [2022-04-28 02:56:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:33,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111222867] [2022-04-28 02:56:33,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111222867] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:33,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:33,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:33,748 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:33,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [127187913] [2022-04-28 02:56:33,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [127187913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:33,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:33,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 02:56:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513933065] [2022-04-28 02:56:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:33,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-28 02:56:33,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:33,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-28 02:56:33,757 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-28 02:56:33,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 02:56:33,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:33,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 02:56:33,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 02:56:33,758 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-28 02:56:33,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:33,807 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 02:56:33,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 02:56:33,807 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-28 02:56:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-28 02:56:33,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 02:56:33,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-28 02:56:33,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 27 transitions. [2022-04-28 02:56:33,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 27 transitions. [2022-04-28 02:56:33,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:33,828 INFO L225 Difference]: With dead ends: 29 [2022-04-28 02:56:33,828 INFO L226 Difference]: Without dead ends: 22 [2022-04-28 02:56:33,829 INFO L412 NwaCegarLoop]: 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-28 02:56:33,829 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:33,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 22 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:33,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-28 02:56:33,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-28 02:56:33,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:33,843 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-28 02:56:33,843 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-28 02:56:33,843 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-28 02:56:33,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:33,846 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 02:56:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 02:56:33,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:33,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:33,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 22 states. [2022-04-28 02:56:33,847 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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 22 states. [2022-04-28 02:56:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:33,853 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-28 02:56:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-28 02:56:33,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:33,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:33,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:33,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:33,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 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-28 02:56:33,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-28 02:56:33,857 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15 [2022-04-28 02:56:33,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:33,857 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-28 02:56:33,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 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-28 02:56:33,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-28 02:56:33,877 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-28 02:56:33,877 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-28 02:56:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 02:56:33,880 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:33,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:33,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:34,088 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:34,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:34,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:34,088 INFO L85 PathProgramCache]: Analyzing trace with hash -2035794270, now seen corresponding path program 1 times [2022-04-28 02:56:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:34,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986012310] [2022-04-28 02:56:36,263 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:56:36,460 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-28 02:56:36,461 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:36,462 INFO L85 PathProgramCache]: Analyzing trace with hash 6363598, now seen corresponding path program 1 times [2022-04-28 02:56:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:36,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460504045] [2022-04-28 02:56:36,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:36,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:36,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:36,472 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:36,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:36,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash -2035794270, now seen corresponding path program 2 times [2022-04-28 02:56:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:36,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3982883] [2022-04-28 02:56:36,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:36,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:36,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:36,558 INFO L290 TraceCheckUtils]: 0: Hoare triple {851#(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); {843#true} is VALID [2022-04-28 02:56:36,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-28 02:56:36,558 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {843#true} {843#true} #42#return; {843#true} is VALID [2022-04-28 02:56:36,559 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {851#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:36,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {851#(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); {843#true} is VALID [2022-04-28 02:56:36,559 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-28 02:56:36,559 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #42#return; {843#true} is VALID [2022-04-28 02:56:36,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret6 := main(); {843#true} is VALID [2022-04-28 02:56:36,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {848#(= main_~x~0 0)} is VALID [2022-04-28 02:56:36,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {848#(= main_~x~0 0)} is VALID [2022-04-28 02:56:36,560 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(= 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 02:56:36,560 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 02:56:36,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} is VALID [2022-04-28 02:56:36,561 INFO L290 TraceCheckUtils]: 10: Hoare triple {850#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {844#false} is VALID [2022-04-28 02:56:36,561 INFO L272 TraceCheckUtils]: 11: Hoare triple {844#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)); {844#false} is VALID [2022-04-28 02:56:36,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-28 02:56:36,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-28 02:56:36,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-28 02:56:36,562 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-28 02:56:36,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:36,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3982883] [2022-04-28 02:56:36,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [3982883] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:36,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258514973] [2022-04-28 02:56:36,562 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 02:56:36,562 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:36,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:36,563 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:36,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 02:56:36,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 02:56:36,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:36,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 02:56:36,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:36,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:36,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {843#true} is VALID [2022-04-28 02:56:36,737 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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); {843#true} is VALID [2022-04-28 02:56:36,737 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-28 02:56:36,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #42#return; {843#true} is VALID [2022-04-28 02:56:36,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret6 := main(); {843#true} is VALID [2022-04-28 02:56:36,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {848#(= main_~x~0 0)} is VALID [2022-04-28 02:56:36,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {848#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {848#(= main_~x~0 0)} is VALID [2022-04-28 02:56:36,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {848#(= 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 02:56:36,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume !!(~x~0 % 4294967296 < 99); {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} is VALID [2022-04-28 02:56:36,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {849#(and (<= 1 main_~x~0) (<= main_~x~0 1))} assume 0 == (if ~y~0 % 4294967296 < 0 && 0 != ~y~0 % 4294967296 % 2 then ~y~0 % 4294967296 % 2 - 2 else ~y~0 % 4294967296 % 2) % 4294967296;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {882#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 02:56:36,740 INFO L290 TraceCheckUtils]: 10: Hoare triple {882#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !(~x~0 % 4294967296 < 99); {844#false} is VALID [2022-04-28 02:56:36,740 INFO L272 TraceCheckUtils]: 11: Hoare triple {844#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)); {844#false} is VALID [2022-04-28 02:56:36,740 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-28 02:56:36,740 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-28 02:56:36,740 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-28 02:56:36,740 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-28 02:56:36,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:36,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {844#false} assume !false; {844#false} is VALID [2022-04-28 02:56:36,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {844#false} assume 0 == ~cond; {844#false} is VALID [2022-04-28 02:56:36,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {844#false} ~cond := #in~cond; {844#false} is VALID [2022-04-28 02:56:36,813 INFO L272 TraceCheckUtils]: 11: Hoare triple {844#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)); {844#false} is VALID [2022-04-28 02:56:36,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {910#(< (mod main_~x~0 4294967296) 99)} assume !(~x~0 % 4294967296 < 99); {844#false} is VALID [2022-04-28 02:56:36,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {914#(< (mod (+ main_~x~0 1) 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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {910#(< (mod main_~x~0 4294967296) 99)} is VALID [2022-04-28 02:56:36,815 INFO L290 TraceCheckUtils]: 8: Hoare triple {914#(< (mod (+ main_~x~0 1) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {914#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-28 02:56:36,815 INFO L290 TraceCheckUtils]: 7: Hoare triple {921#(< (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;#t~post5 := ~x~0;~x~0 := 1 + #t~post5;havoc #t~post5; {914#(< (mod (+ main_~x~0 1) 4294967296) 99)} is VALID [2022-04-28 02:56:36,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {921#(< (mod (+ main_~x~0 2) 4294967296) 99)} assume !!(~x~0 % 4294967296 < 99); {921#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 02:56:36,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {843#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {921#(< (mod (+ main_~x~0 2) 4294967296) 99)} is VALID [2022-04-28 02:56:36,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {843#true} call #t~ret6 := main(); {843#true} is VALID [2022-04-28 02:56:36,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {843#true} {843#true} #42#return; {843#true} is VALID [2022-04-28 02:56:36,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {843#true} assume true; {843#true} is VALID [2022-04-28 02:56:36,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {843#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); {843#true} is VALID [2022-04-28 02:56:36,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {843#true} call ULTIMATE.init(); {843#true} is VALID [2022-04-28 02:56:36,817 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-28 02:56:36,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258514973] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:36,817 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:36,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-28 02:56:36,817 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:36,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986012310] [2022-04-28 02:56:36,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986012310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:36,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:36,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 02:56:36,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440524555] [2022-04-28 02:56:36,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:36,818 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-28 02:56:36,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:36,818 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-28 02:56:36,827 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-28 02:56:36,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 02:56:36,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:36,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 02:56:36,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-04-28 02:56:36,828 INFO L87 Difference]: Start difference. First operand 21 states and 25 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-28 02:56:36,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:36,937 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 02:56:36,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 02:56:36,937 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-28 02:56:36,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:36,937 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-28 02:56:36,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 02:56:36,938 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-28 02:56:36,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2022-04-28 02:56:36,939 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2022-04-28 02:56:36,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:36,960 INFO L225 Difference]: With dead ends: 30 [2022-04-28 02:56:36,960 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 02:56:36,961 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-04-28 02:56:36,961 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:36,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 23 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 02:56:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 02:56:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-28 02:56:36,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:36,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-28 02:56:36,978 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-28 02:56:36,978 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-28 02:56:36,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:36,979 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 02:56:36,979 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 02:56:36,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:36,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:36,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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 25 states. [2022-04-28 02:56:36,979 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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 25 states. [2022-04-28 02:56:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:36,980 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 02:56:36,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 02:56:36,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:36,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:36,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:36,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:36,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 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-28 02:56:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-28 02:56:36,981 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-04-28 02:56:36,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:36,981 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-28 02:56:36,981 INFO L496 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-28 02:56:36,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 27 transitions. [2022-04-28 02:56:37,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-28 02:56:37,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 02:56:37,003 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:37,003 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:37,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:37,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:37,205 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:37,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash 2003644377, now seen corresponding path program 5 times [2022-04-28 02:56:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:37,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1604510943] [2022-04-28 02:56:37,460 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-28 02:56:37,462 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:37,464 INFO L85 PathProgramCache]: Analyzing trace with hash 65468942, now seen corresponding path program 1 times [2022-04-28 02:56:37,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:37,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551913125] [2022-04-28 02:56:37,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:37,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:37,470 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_5) (* (- 2) .v_it_6.0) (* 4294967296 (div (+ main_~x~0_5 (* 2 .v_it_6.0)) 4294967296)) 99) 0)) [2022-04-28 02:56:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2022-04-28 02:56:37,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1812706962] [2022-04-28 02:56:37,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:37,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:37,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:37,485 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:37,486 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 02:56:37,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:37,530 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:37,543 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 02:56:37,543 INFO L85 PathProgramCache]: Analyzing trace with hash 2003644377, now seen corresponding path program 6 times [2022-04-28 02:56:37,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:37,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576647431] [2022-04-28 02:56:37,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:37,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:37,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 02:56:37,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:37,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {1116#(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); {1107#true} is VALID [2022-04-28 02:56:37,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {1107#true} assume true; {1107#true} is VALID [2022-04-28 02:56:37,609 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1107#true} {1107#true} #42#return; {1107#true} is VALID [2022-04-28 02:56:37,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {1107#true} call ULTIMATE.init(); {1116#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 02:56:37,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {1116#(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); {1107#true} is VALID [2022-04-28 02:56:37,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {1107#true} assume true; {1107#true} is VALID [2022-04-28 02:56:37,611 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1107#true} {1107#true} #42#return; {1107#true} is VALID [2022-04-28 02:56:37,611 INFO L272 TraceCheckUtils]: 4: Hoare triple {1107#true} call #t~ret6 := main(); {1107#true} is VALID [2022-04-28 02:56:37,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {1107#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1112#(= main_~x~0 0)} is VALID [2022-04-28 02:56:37,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1112#(= main_~x~0 0)} is VALID [2022-04-28 02:56:37,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(= 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; {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 02:56:37,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 02:56:37,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#(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; {1114#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 02:56:37,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {1114#(and (<= main_~x~0 4) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1114#(and (<= main_~x~0 4) (<= 4 main_~x~0))} is VALID [2022-04-28 02:56:37,614 INFO L290 TraceCheckUtils]: 11: Hoare triple {1114#(and (<= main_~x~0 4) (<= 4 main_~x~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; {1115#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 02:56:37,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {1115#(and (not (<= (+ (div main_~x~0 4294967296) 1) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 99); {1108#false} is VALID [2022-04-28 02:56:37,617 INFO L272 TraceCheckUtils]: 13: Hoare triple {1108#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)); {1108#false} is VALID [2022-04-28 02:56:37,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {1108#false} ~cond := #in~cond; {1108#false} is VALID [2022-04-28 02:56:37,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {1108#false} assume 0 == ~cond; {1108#false} is VALID [2022-04-28 02:56:37,617 INFO L290 TraceCheckUtils]: 16: Hoare triple {1108#false} assume !false; {1108#false} is VALID [2022-04-28 02:56:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:37,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 02:56:37,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576647431] [2022-04-28 02:56:37,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576647431] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 02:56:37,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756874985] [2022-04-28 02:56:37,617 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 02:56:37,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:37,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 02:56:37,618 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 02:56:37,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 02:56:37,644 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 02:56:37,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 02:56:37,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 02:56:37,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 02:56:37,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 02:56:37,757 INFO L272 TraceCheckUtils]: 0: Hoare triple {1107#true} call ULTIMATE.init(); {1107#true} is VALID [2022-04-28 02:56:37,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {1107#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); {1107#true} is VALID [2022-04-28 02:56:37,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {1107#true} assume true; {1107#true} is VALID [2022-04-28 02:56:37,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1107#true} {1107#true} #42#return; {1107#true} is VALID [2022-04-28 02:56:37,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {1107#true} call #t~ret6 := main(); {1107#true} is VALID [2022-04-28 02:56:37,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {1107#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1112#(= main_~x~0 0)} is VALID [2022-04-28 02:56:37,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#(= main_~x~0 0)} assume !!(~x~0 % 4294967296 < 99); {1112#(= main_~x~0 0)} is VALID [2022-04-28 02:56:37,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(= 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; {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 02:56:37,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} assume !!(~x~0 % 4294967296 < 99); {1113#(and (<= 2 main_~x~0) (<= main_~x~0 2))} is VALID [2022-04-28 02:56:37,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {1113#(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; {1147#(and (<= main_~x~0 4) (not (= (mod main_~y~0 2) 0)) (<= 4 main_~x~0))} is VALID [2022-04-28 02:56:37,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {1147#(and (<= main_~x~0 4) (not (= (mod main_~y~0 2) 0)) (<= 4 main_~x~0))} assume !!(~x~0 % 4294967296 < 99); {1147#(and (<= main_~x~0 4) (not (= (mod main_~y~0 2) 0)) (<= 4 main_~x~0))} is VALID [2022-04-28 02:56:37,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {1147#(and (<= main_~x~0 4) (not (= (mod main_~y~0 2) 0)) (<= 4 main_~x~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; {1154#(and (<= 6 main_~x~0) (not (= (mod main_~y~0 2) 0)) (<= main_~x~0 6))} is VALID [2022-04-28 02:56:37,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {1154#(and (<= 6 main_~x~0) (not (= (mod main_~y~0 2) 0)) (<= main_~x~0 6))} assume !(~x~0 % 4294967296 < 99); {1108#false} is VALID [2022-04-28 02:56:37,761 INFO L272 TraceCheckUtils]: 13: Hoare triple {1108#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)); {1108#false} is VALID [2022-04-28 02:56:37,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {1108#false} ~cond := #in~cond; {1108#false} is VALID [2022-04-28 02:56:37,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {1108#false} assume 0 == ~cond; {1108#false} is VALID [2022-04-28 02:56:37,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {1108#false} assume !false; {1108#false} is VALID [2022-04-28 02:56:37,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:37,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 02:56:38,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {1108#false} assume !false; {1108#false} is VALID [2022-04-28 02:56:38,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {1173#(not (<= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1108#false} is VALID [2022-04-28 02:56:38,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {1177#(< 0 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1173#(not (<= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 02:56:38,159 INFO L272 TraceCheckUtils]: 13: Hoare triple {1181#(= (mod main_~x~0 2) (mod main_~y~0 2))} 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)); {1177#(< 0 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 02:56:38,159 INFO L290 TraceCheckUtils]: 12: Hoare triple {1185#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} assume !(~x~0 % 4294967296 < 99); {1181#(= (mod main_~x~0 2) (mod main_~y~0 2))} is VALID [2022-04-28 02:56:38,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {1189#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (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; {1185#(or (< (mod main_~x~0 4294967296) 99) (= (mod main_~x~0 2) (mod main_~y~0 2)))} is VALID [2022-04-28 02:56:38,162 INFO L290 TraceCheckUtils]: 10: Hoare triple {1189#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} assume !!(~x~0 % 4294967296 < 99); {1189#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 02:56:38,163 INFO L290 TraceCheckUtils]: 9: Hoare triple {1196#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod 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; {1189#(or (= (mod main_~x~0 2) (mod main_~y~0 2)) (< (mod (+ main_~x~0 2) 4294967296) 99))} is VALID [2022-04-28 02:56:38,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {1196#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 99); {1196#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-28 02:56:38,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {1203#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod 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; {1196#(or (< (mod (+ main_~x~0 4) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-28 02:56:38,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {1203#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} assume !!(~x~0 % 4294967296 < 99); {1203#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-28 02:56:38,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {1107#true} ~x~0 := 0;~y~0 := #t~nondet4;havoc #t~nondet4; {1203#(or (< (mod (+ main_~x~0 6) 4294967296) 99) (<= 1 (mod main_~x~0 2)))} is VALID [2022-04-28 02:56:38,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {1107#true} call #t~ret6 := main(); {1107#true} is VALID [2022-04-28 02:56:38,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1107#true} {1107#true} #42#return; {1107#true} is VALID [2022-04-28 02:56:38,165 INFO L290 TraceCheckUtils]: 2: Hoare triple {1107#true} assume true; {1107#true} is VALID [2022-04-28 02:56:38,165 INFO L290 TraceCheckUtils]: 1: Hoare triple {1107#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); {1107#true} is VALID [2022-04-28 02:56:38,165 INFO L272 TraceCheckUtils]: 0: Hoare triple {1107#true} call ULTIMATE.init(); {1107#true} is VALID [2022-04-28 02:56:38,166 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 02:56:38,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756874985] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 02:56:38,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-28 02:56:38,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 9] total 16 [2022-04-28 02:56:38,166 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 02:56:38,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1604510943] [2022-04-28 02:56:38,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1604510943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 02:56:38,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 02:56:38,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 02:56:38,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390911775] [2022-04-28 02:56:38,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 02:56:38,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:56:38,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 02:56:38,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:38,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:38,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 02:56:38,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:38,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 02:56:38,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2022-04-28 02:56:38,178 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:38,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:38,360 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-04-28 02:56:38,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 02:56:38,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 02:56:38,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 02:56:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:38,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 02:56:38,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:38,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-28 02:56:38,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-28 02:56:38,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:38,386 INFO L225 Difference]: With dead ends: 34 [2022-04-28 02:56:38,386 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 02:56:38,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2022-04-28 02:56:38,387 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 02:56:38,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 28 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 02:56:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 02:56:38,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-28 02:56:38,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 02:56:38,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-28 02:56:38,409 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-28 02:56:38,409 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-28 02:56:38,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:38,410 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 02:56:38,410 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 02:56:38,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:38,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:38,410 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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 29 states. [2022-04-28 02:56:38,410 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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 29 states. [2022-04-28 02:56:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 02:56:38,412 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-28 02:56:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-28 02:56:38,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 02:56:38,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 02:56:38,413 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 02:56:38,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 02:56:38,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 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-28 02:56:38,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-04-28 02:56:38,413 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2022-04-28 02:56:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 02:56:38,415 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-04-28 02:56:38,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 02:56:38,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 30 transitions. [2022-04-28 02:56:38,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 02:56:38,442 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-28 02:56:38,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 02:56:38,442 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 02:56:38,442 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 02:56:38,461 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 02:56:38,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-28 02:56:38,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10,SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 02:56:38,852 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 02:56:38,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 02:56:38,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1539234595, now seen corresponding path program 3 times [2022-04-28 02:56:38,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 02:56:38,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [137839802] [2022-04-28 02:56:40,030 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 02:56:40,188 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-28 02:56:40,381 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-28 02:56:40,382 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 02:56:40,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1860040717, now seen corresponding path program 1 times [2022-04-28 02:56:40,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 02:56:40,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784854518] [2022-04-28 02:56:40,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 02:56:40,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 02:56:40,410 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_8.0) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_8.0)) 4294967296)) 99) 0)) [2022-04-28 02:56:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:40,432 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 02:56:40,436 WARN L250 erpolLogProxyWrapper]: Quant: Clause contains literal that is not almost uninterpreted: (not (<= (+ (* (- 1) main_~x~0_6) (* (- 2) .v_it_8.1) (* 4294967296 (div (+ main_~x~0_6 (* 2 .v_it_8.1)) 4294967296)) 99) 0)) [2022-04-28 02:56:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 02:56:40,441 ERROR L250 FreeRefinementEngine]: Caught unknown exception: Modelproduction for quantifier theory not implemented. [2022-04-28 02:56:40,441 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-04-28 02:56:40,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 02:56:40,442 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Modelproduction for quantifier theory not implemented. at de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.buildModel(SMTInterpol.java:1144) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getValue(SMTInterpol.java:1009) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getValue(WrapperScript.java:193) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.getValues(SmtUtils.java:2298) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.getValue(TraceCheck.java:439) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.lambda$0(TraceCheck.java:413) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecution(TraceCheck.java:425) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:381) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.computeRcfgProgramExecutionAndDecodeBranches(TraceCheck.java:357) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheck.(TraceCheck.java:222) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheck.(InterpolatingTraceCheck.java:91) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:89) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) 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.lib.acceleratedinterpolation.AcceleratedInterpolationCore.runStrategy(AcceleratedInterpolationCore.java:300) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:289) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) 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:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) 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-28 02:56:40,445 INFO L158 Benchmark]: Toolchain (without parser) took 12335.96ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 121.3MB in the beginning and 176.8MB in the end (delta: -55.5MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:56:40,445 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 137.3MB in the end (delta: 71.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:56:40,445 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.85ms. Allocated memory is still 169.9MB. Free memory was 121.1MB in the beginning and 146.1MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 02:56:40,445 INFO L158 Benchmark]: Boogie Preprocessor took 21.40ms. Allocated memory is still 169.9MB. Free memory was 146.1MB in the beginning and 144.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:56:40,445 INFO L158 Benchmark]: RCFGBuilder took 239.75ms. Allocated memory is still 169.9MB. Free memory was 144.4MB in the beginning and 133.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 02:56:40,445 INFO L158 Benchmark]: TraceAbstraction took 11889.38ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 133.4MB in the beginning and 176.8MB in the end (delta: -43.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 02:56:40,446 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.10ms. Allocated memory is still 169.9MB. Free memory was 137.4MB in the beginning and 137.3MB in the end (delta: 71.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.85ms. Allocated memory is still 169.9MB. Free memory was 121.1MB in the beginning and 146.1MB in the end (delta: -25.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.40ms. Allocated memory is still 169.9MB. Free memory was 146.1MB in the beginning and 144.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 239.75ms. Allocated memory is still 169.9MB. Free memory was 144.4MB in the beginning and 133.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 11889.38ms. Allocated memory was 169.9MB in the beginning and 204.5MB in the end (delta: 34.6MB). Free memory was 133.4MB in the beginning and 176.8MB in the end (delta: -43.4MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Modelproduction for quantifier theory not implemented. de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Modelproduction for quantifier theory not implemented.: de.uni_freiburg.informatik.ultimate.smtinterpol.model.Model.(Model.java:106) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-28 02:56:40,458 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...