/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 15:39:15,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 15:39:15,537 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 15:39:15,574 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 15:39:15,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 15:39:15,576 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 15:39:15,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 15:39:15,587 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 15:39:15,588 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 15:39:15,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 15:39:15,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 15:39:15,590 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 15:39:15,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 15:39:15,591 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 15:39:15,592 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 15:39:15,593 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 15:39:15,594 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 15:39:15,594 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 15:39:15,596 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 15:39:15,597 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 15:39:15,598 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 15:39:15,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 15:39:15,600 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 15:39:15,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 15:39:15,601 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 15:39:15,604 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 15:39:15,604 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 15:39:15,604 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 15:39:15,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 15:39:15,605 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 15:39:15,606 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 15:39:15,606 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 15:39:15,607 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 15:39:15,607 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 15:39:15,608 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 15:39:15,609 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 15:39:15,609 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 15:39:15,610 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 15:39:15,610 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 15:39:15,610 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 15:39:15,611 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 15:39:15,612 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 15:39:15,612 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 15:39:15,624 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 15:39:15,624 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 15:39:15,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 15:39:15,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 15:39:15,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 15:39:15,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 15:39:15,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 15:39:15,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 15:39:15,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 15:39:15,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 15:39:15,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 15:39:15,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 15:39:15,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 15:39:15,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 15:39:15,627 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 15:39:15,627 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:39:15,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 15:39:15,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 15:39:15,628 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 15:39:15,628 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 15:39:15,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 15:39:15,628 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 15:39:15,629 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 15:39:15,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 15:39:15,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 15:39:15,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 15:39:15,882 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 15:39:15,882 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 15:39:15,884 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound50.c [2022-04-15 15:39:15,952 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d457c11/1110898aa86041fcb7921f5e8559c0b1/FLAG40f5c63c5 [2022-04-15 15:39:16,319 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 15:39:16,320 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound50.c [2022-04-15 15:39:16,326 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d457c11/1110898aa86041fcb7921f5e8559c0b1/FLAG40f5c63c5 [2022-04-15 15:39:16,742 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35d457c11/1110898aa86041fcb7921f5e8559c0b1 [2022-04-15 15:39:16,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 15:39:16,744 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 15:39:16,748 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 15:39:16,748 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 15:39:16,751 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 15:39:16,752 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:39:16" (1/1) ... [2022-04-15 15:39:16,754 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37daeee0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:16, skipping insertion in model container [2022-04-15 15:39:16,754 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:39:16" (1/1) ... [2022-04-15 15:39:16,759 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 15:39:16,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 15:39:16,983 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound50.c[537,550] [2022-04-15 15:39:16,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:39:17,007 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 15:39:17,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard-u_unwindbound50.c[537,550] [2022-04-15 15:39:17,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:39:17,036 INFO L208 MainTranslator]: Completed translation [2022-04-15 15:39:17,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17 WrapperNode [2022-04-15 15:39:17,037 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 15:39:17,038 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 15:39:17,038 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 15:39:17,038 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 15:39:17,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17" (1/1) ... [2022-04-15 15:39:17,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17" (1/1) ... [2022-04-15 15:39:17,052 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17" (1/1) ... [2022-04-15 15:39:17,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17" (1/1) ... [2022-04-15 15:39:17,059 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17" (1/1) ... [2022-04-15 15:39:17,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17" (1/1) ... [2022-04-15 15:39:17,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17" (1/1) ... [2022-04-15 15:39:17,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 15:39:17,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 15:39:17,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 15:39:17,076 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 15:39:17,079 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17" (1/1) ... [2022-04-15 15:39:17,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:39:17,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:39:17,108 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 15:39:17,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 15:39:17,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 15:39:17,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 15:39:17,147 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 15:39:17,148 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 15:39:17,148 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 15:39:17,148 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 15:39:17,148 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 15:39:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 15:39:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 15:39:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 15:39:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 15:39:17,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 15:39:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 15:39:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 15:39:17,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 15:39:17,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 15:39:17,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 15:39:17,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 15:39:17,153 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 15:39:17,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 15:39:17,204 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 15:39:17,205 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 15:39:17,338 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 15:39:17,344 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 15:39:17,345 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 15:39:17,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:39:17 BoogieIcfgContainer [2022-04-15 15:39:17,346 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 15:39:17,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 15:39:17,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 15:39:17,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 15:39:17,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:39:16" (1/3) ... [2022-04-15 15:39:17,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a86fa63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:39:17, skipping insertion in model container [2022-04-15 15:39:17,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:39:17" (2/3) ... [2022-04-15 15:39:17,352 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a86fa63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:39:17, skipping insertion in model container [2022-04-15 15:39:17,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:39:17" (3/3) ... [2022-04-15 15:39:17,353 INFO L111 eAbstractionObserver]: Analyzing ICFG hard-u_unwindbound50.c [2022-04-15 15:39:17,357 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 15:39:17,357 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 15:39:17,407 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 15:39:17,412 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 15:39:17,412 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 15:39:17,429 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 15:39:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 15:39:17,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:39:17,436 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:39:17,436 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:39:17,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:39:17,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 1 times [2022-04-15 15:39:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:17,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1996732066] [2022-04-15 15:39:17,458 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:39:17,459 INFO L85 PathProgramCache]: Analyzing trace with hash 1191571617, now seen corresponding path program 2 times [2022-04-15 15:39:17,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:39:17,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816300119] [2022-04-15 15:39:17,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:39:17,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:39:17,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 15:39:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:17,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-15 15:39:17,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:39:17,644 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-15 15:39:17,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 15:39:17,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:17,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:39:17,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 15:39:17,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 15:39:17,654 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-15 15:39:17,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 15:39:17,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {49#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {40#true} is VALID [2022-04-15 15:39:17,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:39:17,657 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #96#return; {40#true} is VALID [2022-04-15 15:39:17,657 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret8 := main(); {40#true} is VALID [2022-04-15 15:39:17,657 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {40#true} is VALID [2022-04-15 15:39:17,657 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {40#true} is VALID [2022-04-15 15:39:17,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:39:17,658 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 15:39:17,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 15:39:17,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41#false} {40#true} #80#return; {41#false} is VALID [2022-04-15 15:39:17,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#false} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {41#false} is VALID [2022-04-15 15:39:17,659 INFO L290 TraceCheckUtils]: 12: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 15:39:17,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 15:39:17,660 INFO L272 TraceCheckUtils]: 14: Hoare triple {41#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {41#false} is VALID [2022-04-15 15:39:17,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 15:39:17,660 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 15:39:17,660 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 15:39:17,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 15:39:17,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:39:17,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816300119] [2022-04-15 15:39:17,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816300119] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:17,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:17,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:39:17,665 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:39:17,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1996732066] [2022-04-15 15:39:17,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1996732066] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:17,665 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:17,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 15:39:17,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043253502] [2022-04-15 15:39:17,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:39:17,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 15:39:17,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:39:17,676 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:17,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:17,701 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 15:39:17,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:17,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 15:39:17,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 15:39:17,721 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:17,896 INFO L93 Difference]: Finished difference Result 66 states and 101 transitions. [2022-04-15 15:39:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 15:39:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 15:39:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:39:17,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:17,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 15:39:17,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:17,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 101 transitions. [2022-04-15 15:39:17,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 101 transitions. [2022-04-15 15:39:18,021 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:18,043 INFO L225 Difference]: With dead ends: 66 [2022-04-15 15:39:18,044 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 15:39:18,047 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 15:39:18,053 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:39:18,055 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:39:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 15:39:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-04-15 15:39:18,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:39:18,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:18,100 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:18,101 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:18,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:18,112 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 15:39:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 15:39:18,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:18,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:18,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-15 15:39:18,114 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 33 states. [2022-04-15 15:39:18,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:18,118 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 15:39:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 15:39:18,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:18,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:18,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:39:18,119 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:39:18,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:18,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2022-04-15 15:39:18,123 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 18 [2022-04-15 15:39:18,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:39:18,123 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2022-04-15 15:39:18,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:18,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 42 transitions. [2022-04-15 15:39:18,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2022-04-15 15:39:18,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 15:39:18,166 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:39:18,166 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:39:18,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 15:39:18,167 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:39:18,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:39:18,173 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 1 times [2022-04-15 15:39:18,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:18,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1557876082] [2022-04-15 15:39:18,179 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:39:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash 336486197, now seen corresponding path program 2 times [2022-04-15 15:39:18,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:39:18,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709202952] [2022-04-15 15:39:18,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:39:18,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:39:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:18,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 15:39:18,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:18,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-15 15:39:18,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 15:39:18,320 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-15 15:39:18,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 15:39:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:18,330 INFO L290 TraceCheckUtils]: 0: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-15 15:39:18,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-15 15:39:18,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 15:39:18,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-15 15:39:18,331 INFO L272 TraceCheckUtils]: 0: Hoare triple {314#true} call ULTIMATE.init(); {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 15:39:18,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {314#true} is VALID [2022-04-15 15:39:18,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 15:39:18,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#true} {314#true} #96#return; {314#true} is VALID [2022-04-15 15:39:18,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#true} call #t~ret8 := main(); {314#true} is VALID [2022-04-15 15:39:18,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {314#true} is VALID [2022-04-15 15:39:18,332 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {314#true} is VALID [2022-04-15 15:39:18,333 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#true} ~cond := #in~cond; {314#true} is VALID [2022-04-15 15:39:18,333 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#true} assume !(0 == ~cond); {314#true} is VALID [2022-04-15 15:39:18,333 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#true} assume true; {314#true} is VALID [2022-04-15 15:39:18,333 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#true} {314#true} #80#return; {314#true} is VALID [2022-04-15 15:39:18,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {314#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {323#(= main_~q~0 0)} is VALID [2022-04-15 15:39:18,334 INFO L290 TraceCheckUtils]: 12: Hoare triple {323#(= main_~q~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-15 15:39:18,336 INFO L290 TraceCheckUtils]: 13: Hoare triple {323#(= main_~q~0 0)} assume !!(#t~post6 < 50);havoc #t~post6; {323#(= main_~q~0 0)} is VALID [2022-04-15 15:39:18,337 INFO L272 TraceCheckUtils]: 14: Hoare triple {323#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:39:18,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {325#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:39:18,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {315#false} is VALID [2022-04-15 15:39:18,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {315#false} assume !false; {315#false} is VALID [2022-04-15 15:39:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 15:39:18,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:39:18,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709202952] [2022-04-15 15:39:18,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709202952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:18,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:18,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:39:18,340 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:39:18,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1557876082] [2022-04-15 15:39:18,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1557876082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:18,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:18,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:39:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781646442] [2022-04-15 15:39:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:39:18,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 15:39:18,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:39:18,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:18,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:18,361 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:39:18,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:18,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:39:18,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 15:39:18,363 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:18,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:18,758 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-04-15 15:39:18,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:39:18,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-15 15:39:18,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:39:18,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:18,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 15:39:18,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:18,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 15:39:18,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 15:39:18,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:18,842 INFO L225 Difference]: With dead ends: 47 [2022-04-15 15:39:18,842 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 15:39:18,842 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:39:18,844 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:39:18,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 90 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:39:18,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 15:39:18,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-04-15 15:39:18,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:39:18,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:18,852 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:18,852 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:18,855 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-15 15:39:18,855 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-15 15:39:18,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:18,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:18,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 15:39:18,857 INFO L87 Difference]: Start difference. First operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 45 states. [2022-04-15 15:39:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:18,861 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2022-04-15 15:39:18,861 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2022-04-15 15:39:18,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:18,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:18,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:39:18,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:39:18,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 22 states have internal predecessors, (27), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:18,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-04-15 15:39:18,865 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 18 [2022-04-15 15:39:18,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:39:18,865 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-04-15 15:39:18,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-15 15:39:18,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 45 transitions. [2022-04-15 15:39:18,912 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:18,913 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-04-15 15:39:18,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-15 15:39:18,913 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:39:18,913 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:39:18,914 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 15:39:18,914 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:39:18,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:39:18,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 1 times [2022-04-15 15:39:18,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:18,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1315943366] [2022-04-15 15:39:18,916 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:39:18,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1819267188, now seen corresponding path program 2 times [2022-04-15 15:39:18,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:39:18,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137952326] [2022-04-15 15:39:18,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:39:18,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:39:18,930 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:39:18,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [9205602] [2022-04-15 15:39:18,931 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:39:18,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:18,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:39:18,932 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:39:18,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-15 15:39:19,012 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:39:19,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:39:19,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 15:39:19,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:19,026 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:39:19,196 INFO L272 TraceCheckUtils]: 0: Hoare triple {593#true} call ULTIMATE.init(); {593#true} is VALID [2022-04-15 15:39:19,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {593#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,211 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#(<= ~counter~0 0)} {593#true} #96#return; {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,213 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#(<= ~counter~0 0)} call #t~ret8 := main(); {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,213 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {601#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#(<= ~counter~0 0)} ~cond := #in~cond; {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#(<= ~counter~0 0)} assume !(0 == ~cond); {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#(<= ~counter~0 0)} assume true; {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,215 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {601#(<= ~counter~0 0)} {601#(<= ~counter~0 0)} #80#return; {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,216 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {601#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:19,216 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {635#(<= |main_#t~post6| 0)} is VALID [2022-04-15 15:39:19,217 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#(<= |main_#t~post6| 0)} assume !(#t~post6 < 50);havoc #t~post6; {594#false} is VALID [2022-04-15 15:39:19,217 INFO L290 TraceCheckUtils]: 14: Hoare triple {594#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {594#false} is VALID [2022-04-15 15:39:19,217 INFO L290 TraceCheckUtils]: 15: Hoare triple {594#false} assume !(#t~post7 < 50);havoc #t~post7; {594#false} is VALID [2022-04-15 15:39:19,218 INFO L272 TraceCheckUtils]: 16: Hoare triple {594#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {594#false} is VALID [2022-04-15 15:39:19,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {594#false} ~cond := #in~cond; {594#false} is VALID [2022-04-15 15:39:19,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {594#false} assume 0 == ~cond; {594#false} is VALID [2022-04-15 15:39:19,218 INFO L290 TraceCheckUtils]: 19: Hoare triple {594#false} assume !false; {594#false} is VALID [2022-04-15 15:39:19,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 15:39:19,219 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:39:19,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:39:19,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137952326] [2022-04-15 15:39:19,219 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:39:19,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9205602] [2022-04-15 15:39:19,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9205602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:19,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:19,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:39:19,220 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:39:19,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1315943366] [2022-04-15 15:39:19,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1315943366] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:19,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:19,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:39:19,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550796316] [2022-04-15 15:39:19,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:39:19,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 15:39:19,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:39:19,222 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 15:39:19,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:19,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:39:19,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:19,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:39:19,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:39:19,246 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 15:39:19,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:19,350 INFO L93 Difference]: Finished difference Result 52 states and 67 transitions. [2022-04-15 15:39:19,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:39:19,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2022-04-15 15:39:19,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:39:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 15:39:19,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-15 15:39:19,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 15:39:19,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2022-04-15 15:39:19,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2022-04-15 15:39:19,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:19,430 INFO L225 Difference]: With dead ends: 52 [2022-04-15 15:39:19,430 INFO L226 Difference]: Without dead ends: 38 [2022-04-15 15:39:19,431 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:39:19,432 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:39:19,432 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:39:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-15 15:39:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-15 15:39:19,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:39:19,447 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:19,447 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:19,448 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:19,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:19,450 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-15 15:39:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 15:39:19,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:19,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:19,451 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-15 15:39:19,452 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 38 states. [2022-04-15 15:39:19,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:19,454 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-04-15 15:39:19,454 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 15:39:19,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:19,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:19,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:39:19,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:39:19,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 24 states have internal predecessors, (29), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:19,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2022-04-15 15:39:19,457 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 20 [2022-04-15 15:39:19,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:39:19,458 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2022-04-15 15:39:19,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 15:39:19,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 47 transitions. [2022-04-15 15:39:19,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2022-04-15 15:39:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 15:39:19,509 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:39:19,509 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:39:19,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 15:39:19,711 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:19,711 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:39:19,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:39:19,712 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 1 times [2022-04-15 15:39:19,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:19,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2125285385] [2022-04-15 15:39:19,713 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:39:19,713 INFO L85 PathProgramCache]: Analyzing trace with hash -784889968, now seen corresponding path program 2 times [2022-04-15 15:39:19,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:39:19,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309288128] [2022-04-15 15:39:19,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:39:19,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:39:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:19,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 15:39:19,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:19,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-15 15:39:19,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 15:39:19,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-15 15:39:19,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 15:39:19,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:19,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 15:39:19,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 15:39:19,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 15:39:19,848 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-15 15:39:19,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-04-15 15:39:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:19,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 15:39:19,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 15:39:19,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 15:39:19,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 15:39:19,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 15:39:19,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {928#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {912#true} is VALID [2022-04-15 15:39:19,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 15:39:19,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #96#return; {912#true} is VALID [2022-04-15 15:39:19,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret8 := main(); {912#true} is VALID [2022-04-15 15:39:19,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {912#true} is VALID [2022-04-15 15:39:19,863 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {912#true} is VALID [2022-04-15 15:39:19,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 15:39:19,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 15:39:19,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 15:39:19,864 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} #80#return; {912#true} is VALID [2022-04-15 15:39:19,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 15:39:19,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 15:39:19,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} assume !!(#t~post6 < 50);havoc #t~post6; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 15:39:19,870 INFO L272 TraceCheckUtils]: 14: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {912#true} is VALID [2022-04-15 15:39:19,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {912#true} ~cond := #in~cond; {912#true} is VALID [2022-04-15 15:39:19,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} assume !(0 == ~cond); {912#true} is VALID [2022-04-15 15:39:19,870 INFO L290 TraceCheckUtils]: 17: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 15:39:19,874 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {912#true} {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} #82#return; {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} is VALID [2022-04-15 15:39:19,875 INFO L272 TraceCheckUtils]: 19: Hoare triple {921#(= (+ main_~A~0 (* (- 1) main_~r~0)) 0)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {926#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:39:19,876 INFO L290 TraceCheckUtils]: 20: Hoare triple {926#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {927#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:39:19,876 INFO L290 TraceCheckUtils]: 21: Hoare triple {927#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-15 15:39:19,877 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-15 15:39:19,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 15:39:19,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:39:19,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309288128] [2022-04-15 15:39:19,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309288128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:19,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:19,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:39:19,878 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:39:19,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2125285385] [2022-04-15 15:39:19,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2125285385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:19,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:19,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:39:19,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030921649] [2022-04-15 15:39:19,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:39:19,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 15:39:19,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:39:19,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:39:19,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:19,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:39:19,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:19,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:39:19,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 15:39:19,909 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:39:20,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:20,314 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 15:39:20,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:39:20,314 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-15 15:39:20,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:39:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:39:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 15:39:20,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:39:20,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 62 transitions. [2022-04-15 15:39:20,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 62 transitions. [2022-04-15 15:39:20,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:20,386 INFO L225 Difference]: With dead ends: 52 [2022-04-15 15:39:20,386 INFO L226 Difference]: Without dead ends: 50 [2022-04-15 15:39:20,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:39:20,388 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 23 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:39:20,388 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:39:20,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-15 15:39:20,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2022-04-15 15:39:20,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:39:20,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:20,403 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:20,403 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:20,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:20,406 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-15 15:39:20,406 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 15:39:20,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:20,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:20,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-15 15:39:20,408 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 50 states. [2022-04-15 15:39:20,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:20,410 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-15 15:39:20,410 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-15 15:39:20,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:20,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:20,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:39:20,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:39:20,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:39:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2022-04-15 15:39:20,413 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 23 [2022-04-15 15:39:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:39:20,414 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2022-04-15 15:39:20,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-15 15:39:20,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 50 transitions. [2022-04-15 15:39:20,466 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2022-04-15 15:39:20,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 15:39:20,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:39:20,467 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:39:20,467 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 15:39:20,468 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:39:20,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:39:20,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 1 times [2022-04-15 15:39:20,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:20,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628608028] [2022-04-15 15:39:20,469 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:39:20,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1024624683, now seen corresponding path program 2 times [2022-04-15 15:39:20,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:39:20,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567365250] [2022-04-15 15:39:20,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:39:20,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:39:20,482 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:39:20,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [528640084] [2022-04-15 15:39:20,483 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:39:20,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:20,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:39:20,484 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:39:20,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 15:39:20,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:39:20,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:39:20,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 15:39:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:20,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:39:20,696 INFO L272 TraceCheckUtils]: 0: Hoare triple {1227#true} call ULTIMATE.init(); {1227#true} is VALID [2022-04-15 15:39:20,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {1227#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1227#true} is VALID [2022-04-15 15:39:20,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 15:39:20,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1227#true} {1227#true} #96#return; {1227#true} is VALID [2022-04-15 15:39:20,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {1227#true} call #t~ret8 := main(); {1227#true} is VALID [2022-04-15 15:39:20,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {1227#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1227#true} is VALID [2022-04-15 15:39:20,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {1227#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1227#true} is VALID [2022-04-15 15:39:20,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-15 15:39:20,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-15 15:39:20,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 15:39:20,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1227#true} {1227#true} #80#return; {1227#true} is VALID [2022-04-15 15:39:20,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {1227#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 15:39:20,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 15:39:20,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 50);havoc #t~post6; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 15:39:20,699 INFO L272 TraceCheckUtils]: 14: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-15 15:39:20,700 INFO L290 TraceCheckUtils]: 15: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-15 15:39:20,700 INFO L290 TraceCheckUtils]: 16: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-15 15:39:20,700 INFO L290 TraceCheckUtils]: 17: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 15:39:20,702 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 15:39:20,702 INFO L272 TraceCheckUtils]: 19: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1227#true} is VALID [2022-04-15 15:39:20,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {1227#true} ~cond := #in~cond; {1227#true} is VALID [2022-04-15 15:39:20,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {1227#true} assume !(0 == ~cond); {1227#true} is VALID [2022-04-15 15:39:20,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {1227#true} assume true; {1227#true} is VALID [2022-04-15 15:39:20,710 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1227#true} {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-15 15:39:20,711 INFO L272 TraceCheckUtils]: 24: Hoare triple {1265#(and (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:39:20,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {1305#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1309#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:39:20,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {1309#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1228#false} is VALID [2022-04-15 15:39:20,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {1228#false} assume !false; {1228#false} is VALID [2022-04-15 15:39:20,712 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:39:20,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:39:20,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:39:20,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567365250] [2022-04-15 15:39:20,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:39:20,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528640084] [2022-04-15 15:39:20,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528640084] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:20,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:20,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:39:20,714 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:39:20,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628608028] [2022-04-15 15:39:20,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628608028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:20,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:20,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:39:20,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325033918] [2022-04-15 15:39:20,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:39:20,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 15:39:20,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:39:20,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:39:20,737 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:20,737 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:39:20,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:20,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:39:20,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:39:20,738 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:39:22,902 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-04-15 15:39:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:23,089 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2022-04-15 15:39:23,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:39:23,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-15 15:39:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:39:23,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:39:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-15 15:39:23,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:39:23,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-15 15:39:23,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-15 15:39:23,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:23,167 INFO L225 Difference]: With dead ends: 59 [2022-04-15 15:39:23,167 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 15:39:23,168 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-15 15:39:23,168 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:39:23,169 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 47 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 15:39:23,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 15:39:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-15 15:39:23,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:39:23,188 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:39:23,188 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:39:23,189 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:39:23,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:23,192 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-15 15:39:23,192 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-15 15:39:23,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:23,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:23,193 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-15 15:39:23,193 INFO L87 Difference]: Start difference. First operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 56 states. [2022-04-15 15:39:23,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:23,196 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2022-04-15 15:39:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-15 15:39:23,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:23,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:23,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:39:23,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:39:23,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 35 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:39:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 71 transitions. [2022-04-15 15:39:23,200 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 71 transitions. Word has length 28 [2022-04-15 15:39:23,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:39:23,200 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 71 transitions. [2022-04-15 15:39:23,200 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-15 15:39:23,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 71 transitions. [2022-04-15 15:39:23,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 71 transitions. [2022-04-15 15:39:23,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 15:39:23,292 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:39:23,292 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:39:23,318 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-15 15:39:23,493 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:23,493 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:39:23,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:39:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 1 times [2022-04-15 15:39:23,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:23,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [620966319] [2022-04-15 15:39:23,494 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:39:23,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1301357193, now seen corresponding path program 2 times [2022-04-15 15:39:23,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:39:23,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939730230] [2022-04-15 15:39:23,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:39:23,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:39:23,510 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:39:23,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [49104829] [2022-04-15 15:39:23,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:39:23,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:23,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:39:23,512 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:39:23,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-15 15:39:23,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:39:23,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:39:23,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 15:39:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:23,576 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:39:23,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {1659#true} call ULTIMATE.init(); {1659#true} is VALID [2022-04-15 15:39:23,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {1659#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,804 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1667#(<= ~counter~0 0)} {1659#true} #96#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {1667#(<= ~counter~0 0)} call #t~ret8 := main(); {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {1667#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {1667#(<= ~counter~0 0)} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {1667#(<= ~counter~0 0)} ~cond := #in~cond; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {1667#(<= ~counter~0 0)} assume !(0 == ~cond); {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {1667#(<= ~counter~0 0)} assume true; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,808 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1667#(<= ~counter~0 0)} {1667#(<= ~counter~0 0)} #80#return; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,808 INFO L290 TraceCheckUtils]: 11: Hoare triple {1667#(<= ~counter~0 0)} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1667#(<= ~counter~0 0)} is VALID [2022-04-15 15:39:23,809 INFO L290 TraceCheckUtils]: 12: Hoare triple {1667#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,809 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#(<= ~counter~0 1)} assume !!(#t~post6 < 50);havoc #t~post6; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,810 INFO L272 TraceCheckUtils]: 14: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,810 INFO L290 TraceCheckUtils]: 15: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,811 INFO L290 TraceCheckUtils]: 17: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,812 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #82#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,813 INFO L272 TraceCheckUtils]: 19: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,814 INFO L290 TraceCheckUtils]: 21: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,814 INFO L290 TraceCheckUtils]: 22: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,815 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #84#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,815 INFO L272 TraceCheckUtils]: 24: Hoare triple {1701#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {1701#(<= ~counter~0 1)} ~cond := #in~cond; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,816 INFO L290 TraceCheckUtils]: 26: Hoare triple {1701#(<= ~counter~0 1)} assume !(0 == ~cond); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {1701#(<= ~counter~0 1)} assume true; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,818 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1701#(<= ~counter~0 1)} {1701#(<= ~counter~0 1)} #86#return; {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {1701#(<= ~counter~0 1)} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {1701#(<= ~counter~0 1)} is VALID [2022-04-15 15:39:23,819 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1756#(<= |main_#t~post7| 1)} is VALID [2022-04-15 15:39:23,819 INFO L290 TraceCheckUtils]: 31: Hoare triple {1756#(<= |main_#t~post7| 1)} assume !(#t~post7 < 50);havoc #t~post7; {1660#false} is VALID [2022-04-15 15:39:23,819 INFO L272 TraceCheckUtils]: 32: Hoare triple {1660#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {1660#false} is VALID [2022-04-15 15:39:23,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {1660#false} ~cond := #in~cond; {1660#false} is VALID [2022-04-15 15:39:23,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {1660#false} assume 0 == ~cond; {1660#false} is VALID [2022-04-15 15:39:23,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {1660#false} assume !false; {1660#false} is VALID [2022-04-15 15:39:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 15:39:23,820 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:39:23,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:39:23,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939730230] [2022-04-15 15:39:23,821 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:39:23,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49104829] [2022-04-15 15:39:23,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49104829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:23,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:23,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:39:23,822 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:39:23,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [620966319] [2022-04-15 15:39:23,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [620966319] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:23,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:23,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:39:23,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905412739] [2022-04-15 15:39:23,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:39:23,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 15:39:23,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:39:23,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 15:39:23,862 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-15 15:39:23,862 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:39:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:23,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:39:23,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:39:23,863 INFO L87 Difference]: Start difference. First operand 56 states and 71 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 15:39:24,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:24,071 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-04-15 15:39:24,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:39:24,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2022-04-15 15:39:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:39:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 15:39:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 15:39:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 15:39:24,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-04-15 15:39:24,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-04-15 15:39:24,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:24,132 INFO L225 Difference]: With dead ends: 76 [2022-04-15 15:39:24,132 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 15:39:24,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:39:24,133 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:39:24,133 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 117 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:39:24,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 15:39:24,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 15:39:24,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:39:24,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:39:24,173 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:39:24,173 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:39:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:24,177 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-15 15:39:24,177 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-15 15:39:24,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:24,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:24,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-15 15:39:24,178 INFO L87 Difference]: Start difference. First operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 69 states. [2022-04-15 15:39:24,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:24,183 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2022-04-15 15:39:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-04-15 15:39:24,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:24,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:24,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:39:24,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:39:24,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 44 states have internal predecessors, (50), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:39:24,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2022-04-15 15:39:24,186 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 36 [2022-04-15 15:39:24,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:39:24,186 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2022-04-15 15:39:24,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-15 15:39:24,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 79 transitions. [2022-04-15 15:39:24,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2022-04-15 15:39:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 15:39:24,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:39:24,278 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:39:24,304 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-15 15:39:24,478 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:24,479 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:39:24,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:39:24,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 1 times [2022-04-15 15:39:24,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:24,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1847101023] [2022-04-15 15:39:24,480 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:39:24,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1303085071, now seen corresponding path program 2 times [2022-04-15 15:39:24,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:39:24,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843519186] [2022-04-15 15:39:24,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:39:24,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:39:24,496 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:39:24,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496860382] [2022-04-15 15:39:24,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:39:24,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:24,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:39:24,507 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:39:24,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-15 15:39:24,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:39:24,575 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:39:24,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 15:39:24,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:24,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:39:25,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2022-04-15 15:39:25,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {2197#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2197#true} is VALID [2022-04-15 15:39:25,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 15:39:25,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #96#return; {2197#true} is VALID [2022-04-15 15:39:25,973 INFO L272 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret8 := main(); {2197#true} is VALID [2022-04-15 15:39:25,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {2197#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2197#true} is VALID [2022-04-15 15:39:25,974 INFO L272 TraceCheckUtils]: 6: Hoare triple {2197#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2197#true} is VALID [2022-04-15 15:39:25,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 15:39:25,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 15:39:25,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 15:39:25,974 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2197#true} {2197#true} #80#return; {2197#true} is VALID [2022-04-15 15:39:25,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {2197#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 15:39:25,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 15:39:25,976 INFO L290 TraceCheckUtils]: 13: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !!(#t~post6 < 50);havoc #t~post6; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 15:39:25,976 INFO L272 TraceCheckUtils]: 14: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-15 15:39:25,976 INFO L290 TraceCheckUtils]: 15: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 15:39:25,976 INFO L290 TraceCheckUtils]: 16: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 15:39:25,976 INFO L290 TraceCheckUtils]: 17: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 15:39:25,979 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #82#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 15:39:25,979 INFO L272 TraceCheckUtils]: 19: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 % 4294967296 == ~A~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-15 15:39:25,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 15:39:25,980 INFO L290 TraceCheckUtils]: 21: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 15:39:25,980 INFO L290 TraceCheckUtils]: 22: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 15:39:25,980 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #84#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 15:39:25,981 INFO L272 TraceCheckUtils]: 24: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 % 4294967296 == ~B~0 * ~p~0 % 4294967296 then 1 else 0)); {2197#true} is VALID [2022-04-15 15:39:25,981 INFO L290 TraceCheckUtils]: 25: Hoare triple {2197#true} ~cond := #in~cond; {2197#true} is VALID [2022-04-15 15:39:25,981 INFO L290 TraceCheckUtils]: 26: Hoare triple {2197#true} assume !(0 == ~cond); {2197#true} is VALID [2022-04-15 15:39:25,981 INFO L290 TraceCheckUtils]: 27: Hoare triple {2197#true} assume true; {2197#true} is VALID [2022-04-15 15:39:25,982 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2197#true} {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} #86#return; {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} is VALID [2022-04-15 15:39:25,982 INFO L290 TraceCheckUtils]: 29: Hoare triple {2235#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 main_~d~0))} assume !(~r~0 % 4294967296 >= ~d~0 % 4294967296); {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-15 15:39:25,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-15 15:39:25,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} assume !!(#t~post7 < 50);havoc #t~post7; {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} is VALID [2022-04-15 15:39:25,992 INFO L272 TraceCheckUtils]: 32: Hoare triple {2290#(and (= main_~A~0 main_~r~0) (not (<= (mod main_~B~0 4294967296) (mod main_~r~0 4294967296))) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~B~0 + ~r~0) % 4294967296 then 1 else 0)); {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:39:25,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {2300#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2304#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:39:25,993 INFO L290 TraceCheckUtils]: 34: Hoare triple {2304#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2198#false} is VALID [2022-04-15 15:39:25,993 INFO L290 TraceCheckUtils]: 35: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2022-04-15 15:39:25,993 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-15 15:39:25,993 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:39:25,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:39:25,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843519186] [2022-04-15 15:39:25,994 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:39:25,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496860382] [2022-04-15 15:39:25,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496860382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:25,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:25,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:39:25,994 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:39:25,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1847101023] [2022-04-15 15:39:25,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1847101023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:25,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:25,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:39:25,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124575961] [2022-04-15 15:39:25,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:39:25,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 15:39:25,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:39:25,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:39:26,034 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-15 15:39:26,034 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:39:26,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:26,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:39:26,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 15:39:26,037 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:39:28,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:28,706 INFO L93 Difference]: Finished difference Result 82 states and 98 transitions. [2022-04-15 15:39:28,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 15:39:28,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-15 15:39:28,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:39:28,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:39:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-15 15:39:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:39:28,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 80 transitions. [2022-04-15 15:39:28,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 80 transitions. [2022-04-15 15:39:28,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:28,812 INFO L225 Difference]: With dead ends: 82 [2022-04-15 15:39:28,812 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 15:39:28,812 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-15 15:39:28,813 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 14 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 15:39:28,813 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 162 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 15:39:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 15:39:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2022-04-15 15:39:28,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:39:28,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:39:28,865 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:39:28,865 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:39:28,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:28,869 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 15:39:28,869 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 15:39:28,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:28,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:28,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-15 15:39:28,871 INFO L87 Difference]: Start difference. First operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 79 states. [2022-04-15 15:39:28,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:39:28,876 INFO L93 Difference]: Finished difference Result 79 states and 94 transitions. [2022-04-15 15:39:28,876 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 94 transitions. [2022-04-15 15:39:28,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:39:28,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:39:28,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:39:28,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:39:28,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 18 states have call successors, (18), 11 states have call predecessors, (18), 10 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:39:28,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 93 transitions. [2022-04-15 15:39:28,880 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 93 transitions. Word has length 36 [2022-04-15 15:39:28,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:39:28,880 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 93 transitions. [2022-04-15 15:39:28,880 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 15:39:28,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 93 transitions. [2022-04-15 15:39:29,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:39:29,004 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 93 transitions. [2022-04-15 15:39:29,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 15:39:29,005 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:39:29,005 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:39:29,022 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-15 15:39:29,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:29,205 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:39:29,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:39:29,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1189074514, now seen corresponding path program 1 times [2022-04-15 15:39:29,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:39:29,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1614583850] [2022-04-15 15:39:30,819 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 15:39:30,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1945491848, now seen corresponding path program 1 times [2022-04-15 15:39:30,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:39:30,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631583486] [2022-04-15 15:39:30,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:39:30,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:39:30,830 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:39:30,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [440421354] [2022-04-15 15:39:30,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:39:30,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:30,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:39:30,831 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-15 15:39:30,856 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-15 15:39:30,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:30,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 15:39:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:39:30,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:39:31,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {2792#true} call ULTIMATE.init(); {2792#true} is VALID [2022-04-15 15:39:31,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {2792#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2792#true} is VALID [2022-04-15 15:39:31,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-15 15:39:31,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2792#true} {2792#true} #96#return; {2792#true} is VALID [2022-04-15 15:39:31,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {2792#true} call #t~ret8 := main(); {2792#true} is VALID [2022-04-15 15:39:31,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {2792#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := #t~nondet5;havoc #t~nondet5; {2792#true} is VALID [2022-04-15 15:39:31,031 INFO L272 TraceCheckUtils]: 6: Hoare triple {2792#true} call assume_abort_if_not((if ~B~0 % 4294967296 >= 1 then 1 else 0)); {2792#true} is VALID [2022-04-15 15:39:31,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {2792#true} ~cond := #in~cond; {2792#true} is VALID [2022-04-15 15:39:31,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {2792#true} assume !(0 == ~cond); {2792#true} is VALID [2022-04-15 15:39:31,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {2792#true} assume true; {2792#true} is VALID [2022-04-15 15:39:31,031 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2792#true} {2792#true} #80#return; {2792#true} is VALID [2022-04-15 15:39:31,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {2792#true} ~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 15:39:31,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [100] L35-3-->L35-1_primed: Formula: (or (let ((.cse0 (mod v_main_~r~0_In_1 4294967296)) (.cse1 (mod (div (- v_main_~d~0_Out_2) (- 2)) 4294967296))) (and (= (mod v_main_~q~0_In_1 4294967296) 0) (= 0 (mod v_main_~p~0_Out_2 2)) (= (mod v_main_~d~0_Out_2 2) 0) (= v_main_~r~0_In_1 0) (= 0 |v_main_#t~post6_Out_2|) (= .cse0 (mod v_main_~A~0_In_1 4294967296)) (= v_main_~p~0_Out_2 0) (= v_main_~p~0_Out_2 v_main_~p~0_In_1) (<= .cse1 .cse0) (= v_main_~A~0_In_1 0) (= (mod (* v_main_~B~0_In_1 (div (- v_main_~p~0_Out_2) (- 2))) 4294967296) .cse1) (= v_main_~B~0_In_1 0) (< v_~counter~0_Out_2 51))) (and (= v_main_~A~0_In_1 v_main_~A~0_In_1) (= v_main_~B~0_In_1 v_main_~B~0_In_1) (= v_main_~r~0_In_1 v_main_~r~0_In_1) (= v_main_~q~0_In_1 v_main_~q~0_In_1) (= v_main_~p~0_In_1 v_main_~p~0_Out_2))) InVars {main_~q~0=v_main_~q~0_In_1, main_~B~0=v_main_~B~0_In_1, main_~A~0=v_main_~A~0_In_1, main_~p~0=v_main_~p~0_In_1, main_~r~0=v_main_~r~0_In_1} OutVars{main_~q~0=v_main_~q~0_In_1, ~counter~0=v_~counter~0_Out_2, main_~d~0=v_main_~d~0_Out_2, main_~B~0=v_main_~B~0_In_1, main_~A~0=v_main_~A~0_In_1, main_~p~0=v_main_~p~0_Out_2, main_~r~0=v_main_~r~0_In_1, main_#t~post6=|v_main_#t~post6_Out_2|} AuxVars[] AssignedVars[~counter~0, main_~d~0, main_~p~0, main_#t~post6] {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 15:39:31,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} [99] L35-1_primed-->L35-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 15:39:31,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post6 < 50);havoc #t~post6; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 15:39:31,034 INFO L290 TraceCheckUtils]: 15: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 15:39:31,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(#t~post7 < 50);havoc #t~post7; {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-15 15:39:31,035 INFO L272 TraceCheckUtils]: 17: Hoare triple {2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~d~0 * ~q~0 + ~r~0) % 4294967296 then 1 else 0)); {2849#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:39:31,035 INFO L290 TraceCheckUtils]: 18: Hoare triple {2849#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2853#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:39:31,036 INFO L290 TraceCheckUtils]: 19: Hoare triple {2853#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2793#false} is VALID [2022-04-15 15:39:31,036 INFO L290 TraceCheckUtils]: 20: Hoare triple {2793#false} assume !false; {2793#false} is VALID [2022-04-15 15:39:31,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 15:39:31,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:39:31,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:39:31,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631583486] [2022-04-15 15:39:31,037 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:39:31,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440421354] [2022-04-15 15:39:31,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440421354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:31,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:31,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:39:35,384 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:39:35,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1614583850] [2022-04-15 15:39:35,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1614583850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:39:35,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:39:35,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:39:35,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462063681] [2022-04-15 15:39:35,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:39:35,385 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 38 [2022-04-15 15:39:35,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:39:35,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:39:37,484 WARN L143 InductivityCheck]: Transition 2866#(and (<= (mod (div (- main_~d~0) (- 2)) 4294967296) (mod main_~r~0 4294967296)) (< ~counter~0 51) (= (mod (div (- main_~d~0) (- 2)) 4294967296) (mod (* main_~B~0 (div (- main_~p~0) (- 2))) 4294967296)) (= (mod main_~d~0 2) 0) (= (mod main_~p~0 2) 0)) ( _ , #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; , 2830#(and (= main_~A~0 main_~r~0) (= main_~q~0 0)) ) not inductive [2022-04-15 15:39:37,501 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-15 15:39:37,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:39:37,688 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inductivity failed at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.checkInductivity(InductivityCheck.java:103) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.(InductivityCheck.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.constructInterpolantAutomaton(BasicCegarLoop.java:682) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.constructRefinementAutomaton(AbstractCegarLoop.java:547) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:420) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-15 15:39:37,691 INFO L158 Benchmark]: Toolchain (without parser) took 20946.58ms. Allocated memory was 188.7MB in the beginning and 229.6MB in the end (delta: 40.9MB). Free memory was 141.1MB in the beginning and 192.0MB in the end (delta: -50.9MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 15:39:37,692 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 188.7MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 15:39:37,695 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.33ms. Allocated memory is still 188.7MB. Free memory was 140.9MB in the beginning and 166.7MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 15:39:37,695 INFO L158 Benchmark]: Boogie Preprocessor took 37.79ms. Allocated memory is still 188.7MB. Free memory was 166.7MB in the beginning and 165.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 15:39:37,696 INFO L158 Benchmark]: RCFGBuilder took 270.24ms. Allocated memory is still 188.7MB. Free memory was 165.1MB in the beginning and 153.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 15:39:37,696 INFO L158 Benchmark]: TraceAbstraction took 20342.60ms. Allocated memory was 188.7MB in the beginning and 229.6MB in the end (delta: 40.9MB). Free memory was 152.9MB in the beginning and 192.0MB in the end (delta: -39.1MB). Peak memory consumption was 3.0MB. Max. memory is 8.0GB. [2022-04-15 15:39:37,697 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.21ms. Allocated memory is still 188.7MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 289.33ms. Allocated memory is still 188.7MB. Free memory was 140.9MB in the beginning and 166.7MB in the end (delta: -25.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.79ms. Allocated memory is still 188.7MB. Free memory was 166.7MB in the beginning and 165.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 270.24ms. Allocated memory is still 188.7MB. Free memory was 165.1MB in the beginning and 153.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 20342.60ms. Allocated memory was 188.7MB in the beginning and 229.6MB in the end (delta: 40.9MB). Free memory was 152.9MB in the beginning and 192.0MB in the end (delta: -39.1MB). Peak memory consumption was 3.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inductivity failed de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inductivity failed: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.InductivityCheck.evaluateResult(InductivityCheck.java:145) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 15:39:37,729 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...