/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/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 16:54:01,017 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 16:54:01,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 16:54:01,064 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 16:54:01,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 16:54:01,066 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 16:54:01,069 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 16:54:01,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 16:54:01,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 16:54:01,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 16:54:01,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 16:54:01,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 16:54:01,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 16:54:01,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 16:54:01,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 16:54:01,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 16:54:01,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 16:54:01,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 16:54:01,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 16:54:01,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 16:54:01,094 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 16:54:01,095 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 16:54:01,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 16:54:01,097 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 16:54:01,098 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 16:54:01,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 16:54:01,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 16:54:01,105 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 16:54:01,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 16:54:01,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 16:54:01,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 16:54:01,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 16:54:01,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 16:54:01,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 16:54:01,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 16:54:01,110 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 16:54:01,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 16:54:01,111 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 16:54:01,111 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 16:54:01,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 16:54:01,112 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 16:54:01,114 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 16:54:01,114 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 16:54:01,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 16:54:01,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 16:54:01,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 16:54:01,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 16:54:01,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 16:54:01,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 16:54:01,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 16:54:01,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 16:54:01,126 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 16:54:01,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 16:54:01,127 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 16:54:01,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 16:54:01,128 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 16:54:01,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 16:54:01,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 16:54:01,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 16:54:01,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 16:54:01,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 16:54:01,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:54:01,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 16:54:01,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 16:54:01,130 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 16:54:01,130 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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-27 16:54:01,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 16:54:01,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 16:54:01,351 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 16:54:01,351 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 16:54:01,352 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 16:54:01,353 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-27 16:54:01,404 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e081500/1f3f7a87579a49549b8aca5cf71b8fb6/FLAG6700d9593 [2022-04-27 16:54:01,706 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 16:54:01,707 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c [2022-04-27 16:54:01,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e081500/1f3f7a87579a49549b8aca5cf71b8fb6/FLAG6700d9593 [2022-04-27 16:54:02,143 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18e081500/1f3f7a87579a49549b8aca5cf71b8fb6 [2022-04-27 16:54:02,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 16:54:02,146 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 16:54:02,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 16:54:02,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 16:54:02,150 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 16:54:02,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@496961e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02, skipping insertion in model container [2022-04-27 16:54:02,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,158 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 16:54:02,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 16:54:02,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2022-04-27 16:54:02,308 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:54:02,316 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 16:54:02,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested5-1.c[321,334] [2022-04-27 16:54:02,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 16:54:02,352 INFO L208 MainTranslator]: Completed translation [2022-04-27 16:54:02,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02 WrapperNode [2022-04-27 16:54:02,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 16:54:02,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 16:54:02,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 16:54:02,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 16:54:02,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,372 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,393 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 16:54:02,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 16:54:02,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 16:54:02,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 16:54:02,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 16:54:02,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:54:02,427 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-27 16:54:02,429 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-27 16:54:02,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 16:54:02,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 16:54:02,456 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 16:54:02,456 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 16:54:02,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 16:54:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 16:54:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 16:54:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 16:54:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 16:54:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 16:54:02,457 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 16:54:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 16:54:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 16:54:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 16:54:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 16:54:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 16:54:02,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 16:54:02,506 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 16:54:02,507 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 16:54:02,639 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 16:54:02,646 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 16:54:02,646 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-27 16:54:02,648 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:54:02 BoogieIcfgContainer [2022-04-27 16:54:02,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 16:54:02,648 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 16:54:02,649 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 16:54:02,650 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 16:54:02,652 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:54:02" (1/1) ... [2022-04-27 16:54:02,654 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 16:54:02,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:54:02 BasicIcfg [2022-04-27 16:54:02,675 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 16:54:02,677 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 16:54:02,677 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 16:54:02,680 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 16:54:02,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 04:54:02" (1/4) ... [2022-04-27 16:54:02,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59af2cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:54:02, skipping insertion in model container [2022-04-27 16:54:02,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 04:54:02" (2/4) ... [2022-04-27 16:54:02,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59af2cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 04:54:02, skipping insertion in model container [2022-04-27 16:54:02,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 04:54:02" (3/4) ... [2022-04-27 16:54:02,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59af2cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:54:02, skipping insertion in model container [2022-04-27 16:54:02,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 04:54:02" (4/4) ... [2022-04-27 16:54:02,682 INFO L111 eAbstractionObserver]: Analyzing ICFG nested5-1.cJordan [2022-04-27 16:54:02,695 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 16:54:02,695 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 16:54:02,730 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 16:54:02,735 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@20583325, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@522a0dd6 [2022-04-27 16:54:02,735 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 16:54:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 16:54:02,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:54:02,751 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:54:02,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:54:02,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:54:02,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:54:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1895308246, now seen corresponding path program 1 times [2022-04-27 16:54:02,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:54:02,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856572557] [2022-04-27 16:54:02,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:54:02,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:54:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:54:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:02,932 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {31#true} is VALID [2022-04-27 16:54:02,932 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:54:02,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31#true} {31#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:54:02,935 INFO L272 TraceCheckUtils]: 0: Hoare triple {31#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:54:02,935 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {31#true} is VALID [2022-04-27 16:54:02,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:54:02,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:54:02,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {31#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {31#true} is VALID [2022-04-27 16:54:02,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {31#true} is VALID [2022-04-27 16:54:02,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {31#true} is VALID [2022-04-27 16:54:02,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {31#true} is VALID [2022-04-27 16:54:02,938 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {31#true} is VALID [2022-04-27 16:54:02,938 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {31#true} is VALID [2022-04-27 16:54:02,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#true} [113] L23-3-->L23-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 16:54:02,939 INFO L272 TraceCheckUtils]: 11: Hoare triple {32#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {32#false} is VALID [2022-04-27 16:54:02,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {32#false} is VALID [2022-04-27 16:54:02,940 INFO L290 TraceCheckUtils]: 13: Hoare triple {32#false} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 16:54:02,940 INFO L290 TraceCheckUtils]: 14: Hoare triple {32#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {32#false} is VALID [2022-04-27 16:54:02,940 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-27 16:54:02,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:54:02,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856572557] [2022-04-27 16:54:02,942 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856572557] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:54:02,942 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:54:02,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 16:54:02,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934063760] [2022-04-27 16:54:02,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:54:02,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:54:02,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:54:02,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:02,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:54:02,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 16:54:02,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:54:02,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 16:54:02,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:54:02,994 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:03,077 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-27 16:54:03,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 16:54:03,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:54:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:54:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 16:54:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2022-04-27 16:54:03,091 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2022-04-27 16:54:03,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:54:03,141 INFO L225 Difference]: With dead ends: 28 [2022-04-27 16:54:03,141 INFO L226 Difference]: Without dead ends: 23 [2022-04-27 16:54:03,143 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 16:54:03,147 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:54:03,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 16:54:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-27 16:54:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-04-27 16:54:03,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:54:03,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:03,173 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:03,173 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:03,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:03,177 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 16:54:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 16:54:03,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:03,178 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:03,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 16:54:03,178 INFO L87 Difference]: Start difference. First operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 23 states. [2022-04-27 16:54:03,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:03,182 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2022-04-27 16:54:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 16:54:03,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:03,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:03,182 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:54:03,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:54:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:03,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-04-27 16:54:03,186 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 15 [2022-04-27 16:54:03,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:54:03,186 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-04-27 16:54:03,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-04-27 16:54:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-27 16:54:03,187 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:54:03,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:54:03,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 16:54:03,188 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:54:03,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:54:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1894384725, now seen corresponding path program 1 times [2022-04-27 16:54:03,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:54:03,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166480990] [2022-04-27 16:54:03,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:54:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:54:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:03,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:54:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:03,350 INFO L290 TraceCheckUtils]: 0: Hoare triple {142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {136#true} is VALID [2022-04-27 16:54:03,351 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-27 16:54:03,351 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-27 16:54:03,352 INFO L272 TraceCheckUtils]: 0: Hoare triple {136#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:54:03,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {142#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {136#true} is VALID [2022-04-27 16:54:03,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {136#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-27 16:54:03,353 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {136#true} {136#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-27 16:54:03,353 INFO L272 TraceCheckUtils]: 4: Hoare triple {136#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {136#true} is VALID [2022-04-27 16:54:03,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {136#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {136#true} is VALID [2022-04-27 16:54:03,354 INFO L290 TraceCheckUtils]: 6: Hoare triple {136#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {136#true} is VALID [2022-04-27 16:54:03,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {136#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {136#true} is VALID [2022-04-27 16:54:03,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {136#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {136#true} is VALID [2022-04-27 16:54:03,357 INFO L290 TraceCheckUtils]: 9: Hoare triple {136#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {141#(= main_~v~0 0)} is VALID [2022-04-27 16:54:03,358 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#(= main_~v~0 0)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {137#false} is VALID [2022-04-27 16:54:03,358 INFO L272 TraceCheckUtils]: 11: Hoare triple {137#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {137#false} is VALID [2022-04-27 16:54:03,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {137#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {137#false} is VALID [2022-04-27 16:54:03,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {137#false} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {137#false} is VALID [2022-04-27 16:54:03,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {137#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {137#false} is VALID [2022-04-27 16:54:03,359 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-27 16:54:03,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:54:03,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166480990] [2022-04-27 16:54:03,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166480990] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:54:03,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 16:54:03,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 16:54:03,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98211395] [2022-04-27 16:54:03,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:54:03,362 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:54:03,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:54:03,362 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:54:03,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 16:54:03,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:54:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 16:54:03,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 16:54:03,390 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:03,555 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-27 16:54:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 16:54:03,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-04-27 16:54:03,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:54:03,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-27 16:54:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 40 transitions. [2022-04-27 16:54:03,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 40 transitions. [2022-04-27 16:54:03,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:54:03,600 INFO L225 Difference]: With dead ends: 32 [2022-04-27 16:54:03,600 INFO L226 Difference]: Without dead ends: 32 [2022-04-27 16:54:03,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 16:54:03,601 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 41 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:54:03,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 31 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:54:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-27 16:54:03,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-04-27 16:54:03,605 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:54:03,605 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:03,605 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:03,606 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:03,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:03,608 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-27 16:54:03,608 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 16:54:03,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:03,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:03,609 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 16:54:03,609 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 32 states. [2022-04-27 16:54:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:03,611 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-04-27 16:54:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-04-27 16:54:03,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:03,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:03,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:54:03,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:54:03,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-04-27 16:54:03,614 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 15 [2022-04-27 16:54:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:54:03,614 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-04-27 16:54:03,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,614 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 16:54:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-27 16:54:03,615 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:54:03,615 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:54:03,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 16:54:03,615 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:54:03,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:54:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1473809801, now seen corresponding path program 1 times [2022-04-27 16:54:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:54:03,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899627996] [2022-04-27 16:54:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:54:03,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:54:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:03,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:54:03,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:03,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {268#true} is VALID [2022-04-27 16:54:03,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {268#true} {268#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {268#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:54:03,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {275#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {268#true} is VALID [2022-04-27 16:54:03,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {268#true} {268#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {268#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {268#true} is VALID [2022-04-27 16:54:03,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {268#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {268#true} is VALID [2022-04-27 16:54:03,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {268#true} is VALID [2022-04-27 16:54:03,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {268#true} is VALID [2022-04-27 16:54:03,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {273#(= main_~v~0 0)} is VALID [2022-04-27 16:54:03,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {273#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {273#(= main_~v~0 0)} is VALID [2022-04-27 16:54:03,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {274#(and (<= main_~v~0 1) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:54:03,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {274#(and (<= main_~v~0 1) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {269#false} is VALID [2022-04-27 16:54:03,702 INFO L272 TraceCheckUtils]: 13: Hoare triple {269#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {269#false} is VALID [2022-04-27 16:54:03,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {269#false} is VALID [2022-04-27 16:54:03,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#false} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {269#false} is VALID [2022-04-27 16:54:03,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {269#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#false} is VALID [2022-04-27 16:54:03,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:54:03,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:54:03,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899627996] [2022-04-27 16:54:03,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899627996] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:54:03,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257313650] [2022-04-27 16:54:03,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:54:03,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:54:03,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:54:03,711 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-27 16:54:03,713 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-27 16:54:03,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:03,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-27 16:54:03,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:03,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:54:03,867 INFO L272 TraceCheckUtils]: 0: Hoare triple {268#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,867 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {268#true} is VALID [2022-04-27 16:54:03,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {268#true} {268#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {268#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,868 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {268#true} is VALID [2022-04-27 16:54:03,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {268#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {268#true} is VALID [2022-04-27 16:54:03,869 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {268#true} is VALID [2022-04-27 16:54:03,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {268#true} is VALID [2022-04-27 16:54:03,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {273#(= main_~v~0 0)} is VALID [2022-04-27 16:54:03,870 INFO L290 TraceCheckUtils]: 10: Hoare triple {273#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {273#(= main_~v~0 0)} is VALID [2022-04-27 16:54:03,870 INFO L290 TraceCheckUtils]: 11: Hoare triple {273#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {312#(= main_~v~0 1)} is VALID [2022-04-27 16:54:03,871 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#(= main_~v~0 1)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {269#false} is VALID [2022-04-27 16:54:03,871 INFO L272 TraceCheckUtils]: 13: Hoare triple {269#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {269#false} is VALID [2022-04-27 16:54:03,871 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {269#false} is VALID [2022-04-27 16:54:03,872 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#false} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {269#false} is VALID [2022-04-27 16:54:03,872 INFO L290 TraceCheckUtils]: 16: Hoare triple {269#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#false} is VALID [2022-04-27 16:54:03,872 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:54:03,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:54:03,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {269#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {269#false} is VALID [2022-04-27 16:54:03,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {269#false} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {269#false} is VALID [2022-04-27 16:54:03,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {269#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {269#false} is VALID [2022-04-27 16:54:03,946 INFO L272 TraceCheckUtils]: 13: Hoare triple {269#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {269#false} is VALID [2022-04-27 16:54:03,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {340#(< (mod main_~v~0 4294967296) 10)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {269#false} is VALID [2022-04-27 16:54:03,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {344#(< (mod (+ main_~v~0 1) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {340#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-27 16:54:03,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {344#(< (mod (+ main_~v~0 1) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {344#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-27 16:54:03,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {344#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-27 16:54:03,949 INFO L290 TraceCheckUtils]: 8: Hoare triple {268#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {268#true} is VALID [2022-04-27 16:54:03,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {268#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {268#true} is VALID [2022-04-27 16:54:03,949 INFO L290 TraceCheckUtils]: 6: Hoare triple {268#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {268#true} is VALID [2022-04-27 16:54:03,949 INFO L290 TraceCheckUtils]: 5: Hoare triple {268#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {268#true} is VALID [2022-04-27 16:54:03,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {268#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {268#true} {268#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {268#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {268#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {268#true} is VALID [2022-04-27 16:54:03,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {268#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {268#true} is VALID [2022-04-27 16:54:03,951 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:54:03,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257313650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:54:03,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:54:03,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 16:54:03,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568561992] [2022-04-27 16:54:03,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:54:03,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:54:03,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:54:03,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:03,972 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-27 16:54:03,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 16:54:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:54:03,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 16:54:03,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-04-27 16:54:03,973 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:04,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:04,232 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 16:54:04,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 16:54:04,232 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-27 16:54:04,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:54:04,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:04,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 16:54:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:04,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 16:54:04,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-27 16:54:04,290 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-27 16:54:04,291 INFO L225 Difference]: With dead ends: 37 [2022-04-27 16:54:04,292 INFO L226 Difference]: Without dead ends: 37 [2022-04-27 16:54:04,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-04-27 16:54:04,295 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 16:54:04,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 41 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 16:54:04,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-27 16:54:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-04-27 16:54:04,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:54:04,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:04,307 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:04,308 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:04,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:04,314 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 16:54:04,314 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 16:54:04,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:04,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:04,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-27 16:54:04,316 INFO L87 Difference]: Start difference. First operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-04-27 16:54:04,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:04,320 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-27 16:54:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-27 16:54:04,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:04,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:04,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:54:04,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:54:04,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:04,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-27 16:54:04,327 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 17 [2022-04-27 16:54:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:54:04,327 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-27 16:54:04,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-27 16:54:04,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-27 16:54:04,328 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:54:04,328 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:54:04,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 16:54:04,550 WARN L477 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-27 16:54:04,551 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:54:04,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:54:04,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1878931933, now seen corresponding path program 2 times [2022-04-27 16:54:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:54:04,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113045053] [2022-04-27 16:54:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:54:04,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:54:04,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:04,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:54:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:04,734 INFO L290 TraceCheckUtils]: 0: Hoare triple {540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {530#true} is VALID [2022-04-27 16:54:04,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:04,734 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {530#true} {530#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:04,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:54:04,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {530#true} is VALID [2022-04-27 16:54:04,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:04,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:04,737 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:04,737 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {530#true} is VALID [2022-04-27 16:54:04,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {530#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {530#true} is VALID [2022-04-27 16:54:04,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {530#true} is VALID [2022-04-27 16:54:04,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {530#true} is VALID [2022-04-27 16:54:04,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {535#(= main_~v~0 0)} is VALID [2022-04-27 16:54:04,744 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {535#(= main_~v~0 0)} is VALID [2022-04-27 16:54:04,747 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {536#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 16:54:04,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {536#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 16:54:04,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {537#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 16:54:04,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {537#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {537#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 16:54:04,750 INFO L290 TraceCheckUtils]: 15: Hoare triple {537#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {538#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 16:54:04,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {538#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 16:54:04,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {538#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {539#(and (<= main_~v~0 4) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} is VALID [2022-04-27 16:54:04,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {539#(and (<= main_~v~0 4) (not (<= (+ (div main_~v~0 4294967296) 1) 0)))} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {531#false} is VALID [2022-04-27 16:54:04,753 INFO L272 TraceCheckUtils]: 19: Hoare triple {531#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {531#false} is VALID [2022-04-27 16:54:04,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {531#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {531#false} is VALID [2022-04-27 16:54:04,753 INFO L290 TraceCheckUtils]: 21: Hoare triple {531#false} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {531#false} is VALID [2022-04-27 16:54:04,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {531#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {531#false} is VALID [2022-04-27 16:54:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:54:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:54:04,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113045053] [2022-04-27 16:54:04,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113045053] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:54:04,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [478144955] [2022-04-27 16:54:04,755 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 16:54:04,755 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:54:04,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:54:04,760 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-27 16:54:04,788 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-27 16:54:04,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 16:54:04,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:54:04,810 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-27 16:54:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:04,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:54:05,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:05,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {530#true} is VALID [2022-04-27 16:54:05,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:05,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:05,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:05,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {530#true} is VALID [2022-04-27 16:54:05,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {530#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {530#true} is VALID [2022-04-27 16:54:05,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {530#true} is VALID [2022-04-27 16:54:05,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {530#true} is VALID [2022-04-27 16:54:05,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {535#(= main_~v~0 0)} is VALID [2022-04-27 16:54:05,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {535#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {535#(= main_~v~0 0)} is VALID [2022-04-27 16:54:05,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {535#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {536#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 16:54:05,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {536#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {536#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 16:54:05,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {536#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {537#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 16:54:05,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {537#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {537#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 16:54:05,134 INFO L290 TraceCheckUtils]: 15: Hoare triple {537#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {538#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 16:54:05,135 INFO L290 TraceCheckUtils]: 16: Hoare triple {538#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {538#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 16:54:05,139 INFO L290 TraceCheckUtils]: 17: Hoare triple {538#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {595#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 16:54:05,140 INFO L290 TraceCheckUtils]: 18: Hoare triple {595#(and (<= main_~v~0 4) (<= 4 main_~v~0))} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {531#false} is VALID [2022-04-27 16:54:05,140 INFO L272 TraceCheckUtils]: 19: Hoare triple {531#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {531#false} is VALID [2022-04-27 16:54:05,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {531#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {531#false} is VALID [2022-04-27 16:54:05,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {531#false} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {531#false} is VALID [2022-04-27 16:54:05,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {531#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {531#false} is VALID [2022-04-27 16:54:05,141 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:54:05,141 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 16:54:05,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {531#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {531#false} is VALID [2022-04-27 16:54:05,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {531#false} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {531#false} is VALID [2022-04-27 16:54:05,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {531#false} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {531#false} is VALID [2022-04-27 16:54:05,324 INFO L272 TraceCheckUtils]: 19: Hoare triple {531#false} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {531#false} is VALID [2022-04-27 16:54:05,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {623#(< (mod main_~v~0 4294967296) 10)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {531#false} is VALID [2022-04-27 16:54:05,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {627#(< (mod (+ main_~v~0 1) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {623#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-27 16:54:05,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {627#(< (mod (+ main_~v~0 1) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {627#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-27 16:54:05,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {634#(< (mod (+ main_~v~0 2) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {627#(< (mod (+ main_~v~0 1) 4294967296) 10)} is VALID [2022-04-27 16:54:05,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {634#(< (mod (+ main_~v~0 2) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {634#(< (mod (+ main_~v~0 2) 4294967296) 10)} is VALID [2022-04-27 16:54:05,328 INFO L290 TraceCheckUtils]: 13: Hoare triple {641#(< (mod (+ main_~v~0 3) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {634#(< (mod (+ main_~v~0 2) 4294967296) 10)} is VALID [2022-04-27 16:54:05,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {641#(< (mod (+ main_~v~0 3) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {641#(< (mod (+ main_~v~0 3) 4294967296) 10)} is VALID [2022-04-27 16:54:05,330 INFO L290 TraceCheckUtils]: 11: Hoare triple {648#(< (mod (+ main_~v~0 4) 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {641#(< (mod (+ main_~v~0 3) 4294967296) 10)} is VALID [2022-04-27 16:54:05,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {648#(< (mod (+ main_~v~0 4) 4294967296) 10)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {648#(< (mod (+ main_~v~0 4) 4294967296) 10)} is VALID [2022-04-27 16:54:05,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {530#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {648#(< (mod (+ main_~v~0 4) 4294967296) 10)} is VALID [2022-04-27 16:54:05,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {530#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {530#true} is VALID [2022-04-27 16:54:05,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {530#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {530#true} is VALID [2022-04-27 16:54:05,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {530#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {530#true} is VALID [2022-04-27 16:54:05,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {530#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {530#true} is VALID [2022-04-27 16:54:05,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {530#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:05,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {530#true} {530#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:05,332 INFO L290 TraceCheckUtils]: 2: Hoare triple {530#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:05,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {530#true} is VALID [2022-04-27 16:54:05,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {530#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {530#true} is VALID [2022-04-27 16:54:05,333 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:54:05,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [478144955] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 16:54:05,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 16:54:05,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 16:54:05,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897871982] [2022-04-27 16:54:05,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 16:54:05,334 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 16:54:05,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:54:05,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:05,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:54:05,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 16:54:05,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:54:05,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 16:54:05,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-04-27 16:54:05,372 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:06,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:06,179 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 16:54:06,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 16:54:06,180 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-27 16:54:06,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:54:06,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:06,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 62 transitions. [2022-04-27 16:54:06,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:06,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 62 transitions. [2022-04-27 16:54:06,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 62 transitions. [2022-04-27 16:54:06,264 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-27 16:54:06,265 INFO L225 Difference]: With dead ends: 49 [2022-04-27 16:54:06,265 INFO L226 Difference]: Without dead ends: 49 [2022-04-27 16:54:06,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-04-27 16:54:06,266 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 100 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 16:54:06,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 61 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 16:54:06,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-27 16:54:06,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2022-04-27 16:54:06,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:54:06,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:06,270 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:06,270 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:06,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:06,272 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 16:54:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-27 16:54:06,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:06,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:06,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-27 16:54:06,273 INFO L87 Difference]: Start difference. First operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 49 states. [2022-04-27 16:54:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:06,274 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-04-27 16:54:06,274 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-04-27 16:54:06,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:06,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:06,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:54:06,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:54:06,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 36 states have (on average 1.1388888888888888) internal successors, (41), 36 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 16:54:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-27 16:54:06,276 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 23 [2022-04-27 16:54:06,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:54:06,277 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-27 16:54:06,277 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-27 16:54:06,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-27 16:54:06,278 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 16:54:06,278 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 16:54:06,307 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-27 16:54:06,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 16:54:06,501 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 16:54:06,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 16:54:06,501 INFO L85 PathProgramCache]: Analyzing trace with hash -607664937, now seen corresponding path program 3 times [2022-04-27 16:54:06,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 16:54:06,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133142144] [2022-04-27 16:54:06,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 16:54:06,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 16:54:06,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:06,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 16:54:06,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:06,784 INFO L290 TraceCheckUtils]: 0: Hoare triple {912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {894#true} is VALID [2022-04-27 16:54:06,785 INFO L290 TraceCheckUtils]: 1: Hoare triple {894#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:06,785 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {894#true} {894#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:06,786 INFO L272 TraceCheckUtils]: 0: Hoare triple {894#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 16:54:06,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {894#true} is VALID [2022-04-27 16:54:06,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {894#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:06,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {894#true} {894#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:06,786 INFO L272 TraceCheckUtils]: 4: Hoare triple {894#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:06,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {894#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {894#true} is VALID [2022-04-27 16:54:06,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {894#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {894#true} is VALID [2022-04-27 16:54:06,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {894#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {894#true} is VALID [2022-04-27 16:54:06,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {894#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {894#true} is VALID [2022-04-27 16:54:06,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {894#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {899#(= main_~v~0 0)} is VALID [2022-04-27 16:54:06,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {899#(= main_~v~0 0)} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {899#(= main_~v~0 0)} is VALID [2022-04-27 16:54:06,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {899#(= main_~v~0 0)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {900#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 16:54:06,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {900#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {900#(and (<= main_~v~0 1) (<= 1 main_~v~0))} is VALID [2022-04-27 16:54:06,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {900#(and (<= main_~v~0 1) (<= 1 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {901#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 16:54:06,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {901#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {901#(and (<= 2 main_~v~0) (<= main_~v~0 2))} is VALID [2022-04-27 16:54:06,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {901#(and (<= 2 main_~v~0) (<= main_~v~0 2))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {902#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 16:54:06,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {902#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {902#(and (<= main_~v~0 3) (<= 3 main_~v~0))} is VALID [2022-04-27 16:54:06,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {902#(and (<= main_~v~0 3) (<= 3 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {903#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 16:54:06,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {903#(and (<= main_~v~0 4) (<= 4 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {903#(and (<= main_~v~0 4) (<= 4 main_~v~0))} is VALID [2022-04-27 16:54:06,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {903#(and (<= main_~v~0 4) (<= 4 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {904#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 16:54:06,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {904#(and (<= main_~v~0 5) (<= 5 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {904#(and (<= main_~v~0 5) (<= 5 main_~v~0))} is VALID [2022-04-27 16:54:06,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {904#(and (<= main_~v~0 5) (<= 5 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {905#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 16:54:06,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {905#(and (<= 6 main_~v~0) (<= main_~v~0 6))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {905#(and (<= 6 main_~v~0) (<= main_~v~0 6))} is VALID [2022-04-27 16:54:06,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {905#(and (<= 6 main_~v~0) (<= main_~v~0 6))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {906#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 16:54:06,801 INFO L290 TraceCheckUtils]: 24: Hoare triple {906#(and (<= main_~v~0 7) (<= 7 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {906#(and (<= main_~v~0 7) (<= 7 main_~v~0))} is VALID [2022-04-27 16:54:06,802 INFO L290 TraceCheckUtils]: 25: Hoare triple {906#(and (<= main_~v~0 7) (<= 7 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {907#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 16:54:06,802 INFO L290 TraceCheckUtils]: 26: Hoare triple {907#(and (<= main_~v~0 8) (<= 8 main_~v~0))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {907#(and (<= main_~v~0 8) (<= 8 main_~v~0))} is VALID [2022-04-27 16:54:06,803 INFO L290 TraceCheckUtils]: 27: Hoare triple {907#(and (<= main_~v~0 8) (<= 8 main_~v~0))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {908#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 16:54:06,803 INFO L290 TraceCheckUtils]: 28: Hoare triple {908#(and (<= 9 main_~v~0) (<= main_~v~0 9))} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {908#(and (<= 9 main_~v~0) (<= main_~v~0 9))} is VALID [2022-04-27 16:54:06,804 INFO L290 TraceCheckUtils]: 29: Hoare triple {908#(and (<= 9 main_~v~0) (<= main_~v~0 9))} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {909#(and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))} is VALID [2022-04-27 16:54:06,804 INFO L290 TraceCheckUtils]: 30: Hoare triple {909#(and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {909#(and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))} is VALID [2022-04-27 16:54:06,805 INFO L272 TraceCheckUtils]: 31: Hoare triple {909#(and (<= 10 main_~v~0) (<= (div main_~v~0 4) 2))} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {910#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} is VALID [2022-04-27 16:54:06,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {910#(or (<= 2 |__VERIFIER_assert_#in~cond|) (<= (+ 2 |__VERIFIER_assert_#in~cond|) 0))} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {911#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} is VALID [2022-04-27 16:54:06,806 INFO L290 TraceCheckUtils]: 33: Hoare triple {911#(or (<= 2 __VERIFIER_assert_~cond) (<= (+ 2 __VERIFIER_assert_~cond) 0))} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {895#false} is VALID [2022-04-27 16:54:06,806 INFO L290 TraceCheckUtils]: 34: Hoare triple {895#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#false} is VALID [2022-04-27 16:54:06,807 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 16:54:06,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 16:54:06,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133142144] [2022-04-27 16:54:06,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133142144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 16:54:06,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891825780] [2022-04-27 16:54:06,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 16:54:06,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:54:06,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 16:54:06,809 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-27 16:54:06,810 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-27 16:54:06,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-04-27 16:54:06,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 16:54:06,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-27 16:54:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 16:54:06,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 16:54:09,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {894#true} [90] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {894#true} [92] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {894#true} is VALID [2022-04-27 16:54:09,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {894#true} [95] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {894#true} {894#true} [125] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {894#true} [91] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {894#true} [94] mainENTRY-->L19-3: Formula: (and (= v_main_~x~0_1 0) (= v_main_~w~0_3 0) (= v_main_~v~0_1 0) (= v_main_~z~0_2 0) (= v_main_~y~0_1 0)) InVars {} OutVars{main_~y~0=v_main_~y~0_1, main_~v~0=v_main_~v~0_1, main_~w~0=v_main_~w~0_3, main_~x~0=v_main_~x~0_1, main_~z~0=v_main_~z~0_2} AuxVars[] AssignedVars[main_~v~0, main_~w~0, main_~x~0, main_~z~0, main_~y~0] {894#true} is VALID [2022-04-27 16:54:09,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {894#true} [98] L19-3-->L20-3: Formula: (and (= v_main_~x~0_2 0) (< (mod v_main_~w~0_6 4294967296) 268435455)) InVars {main_~w~0=v_main_~w~0_6} OutVars{main_~x~0=v_main_~x~0_2, main_~w~0=v_main_~w~0_6} AuxVars[] AssignedVars[main_~x~0] {894#true} is VALID [2022-04-27 16:54:09,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {894#true} [102] L20-3-->L21-3: Formula: (and (< (mod v_main_~x~0_4 4294967296) 10) (= v_main_~y~0_2 0)) InVars {main_~x~0=v_main_~x~0_4} OutVars{main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_2} AuxVars[] AssignedVars[main_~y~0] {894#true} is VALID [2022-04-27 16:54:09,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {894#true} [107] L21-3-->L22-2: Formula: (and (< (mod v_main_~y~0_6 4294967296) 10) (= v_main_~z~0_6 0)) InVars {main_~y~0=v_main_~y~0_6} OutVars{main_~y~0=v_main_~y~0_6, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~z~0] {894#true} is VALID [2022-04-27 16:54:09,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {894#true} [111] L22-2-->L23-3: Formula: (and (= v_main_~v~0_2 0) (< (mod v_main_~z~0_3 4294967296) 10)) InVars {main_~z~0=v_main_~z~0_3} OutVars{main_~v~0=v_main_~v~0_2, main_~z~0=v_main_~z~0_3} AuxVars[] AssignedVars[main_~v~0] {894#true} is VALID [2022-04-27 16:54:09,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {894#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {894#true} is VALID [2022-04-27 16:54:09,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {894#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {894#true} is VALID [2022-04-27 16:54:09,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {894#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {894#true} is VALID [2022-04-27 16:54:09,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {894#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {894#true} is VALID [2022-04-27 16:54:09,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {894#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {894#true} is VALID [2022-04-27 16:54:09,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {894#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {894#true} is VALID [2022-04-27 16:54:09,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {894#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {894#true} is VALID [2022-04-27 16:54:09,529 INFO L290 TraceCheckUtils]: 24: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,529 INFO L290 TraceCheckUtils]: 25: Hoare triple {894#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {894#true} is VALID [2022-04-27 16:54:09,529 INFO L290 TraceCheckUtils]: 26: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {894#true} is VALID [2022-04-27 16:54:09,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {894#true} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {894#true} is VALID [2022-04-27 16:54:09,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {894#true} [115] L23-3-->L23-2: Formula: (< (mod v_main_~v~0_4 4294967296) 10) InVars {main_~v~0=v_main_~v~0_4} OutVars{main_~v~0=v_main_~v~0_4} AuxVars[] AssignedVars[] {1000#(< (mod main_~v~0 4294967296) 10)} is VALID [2022-04-27 16:54:09,536 INFO L290 TraceCheckUtils]: 29: Hoare triple {1000#(< (mod main_~v~0 4294967296) 10)} [117] L23-2-->L23-3: Formula: (= v_main_~v~0_5 (+ v_main_~v~0_6 1)) InVars {main_~v~0=v_main_~v~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[main_~v~0, main_#t~post8] {1004#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} is VALID [2022-04-27 16:54:09,537 INFO L290 TraceCheckUtils]: 30: Hoare triple {1004#(< (mod (+ main_~v~0 4294967295) 4294967296) 10)} [114] L23-3-->L23-4: Formula: (not (< (mod v_main_~v~0_3 4294967296) 10)) InVars {main_~v~0=v_main_~v~0_3} OutVars{main_~v~0=v_main_~v~0_3} AuxVars[] AssignedVars[] {1008#(and (not (< (mod main_~v~0 4294967296) 10)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))} is VALID [2022-04-27 16:54:09,566 INFO L272 TraceCheckUtils]: 31: Hoare triple {1008#(and (not (< (mod main_~v~0 4294967296) 10)) (< (mod (+ main_~v~0 4294967295) 4294967296) 10))} [116] L23-4-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (mod v_main_~v~0_8 4)) InVars {main_~v~0=v_main_~v~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0] {1012#(and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~v~0_BEFORE_CALL_1_33 Int)) (and (< (mod (+ |__VERIFIER_assert_#in~cond| 4294967295 (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4)) 4294967296) 10) (not (< (mod (+ |__VERIFIER_assert_#in~cond| (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4)) 4294967296) 10)))) (< |__VERIFIER_assert_#in~cond| 4))} is VALID [2022-04-27 16:54:09,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {1012#(and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((aux_div_v_main_~v~0_BEFORE_CALL_1_33 Int)) (and (< (mod (+ |__VERIFIER_assert_#in~cond| 4294967295 (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4)) 4294967296) 10) (not (< (mod (+ |__VERIFIER_assert_#in~cond| (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4)) 4294967296) 10)))) (< |__VERIFIER_assert_#in~cond| 4))} [119] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_2 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1016#(and (< __VERIFIER_assert_~cond 4) (<= 0 __VERIFIER_assert_~cond) (exists ((aux_div_v_main_~v~0_BEFORE_CALL_1_33 Int)) (and (not (< (mod (+ (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4) __VERIFIER_assert_~cond) 4294967296) 10)) (< (mod (+ 4294967295 (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4) __VERIFIER_assert_~cond) 4294967296) 10))))} is VALID [2022-04-27 16:54:09,568 INFO L290 TraceCheckUtils]: 33: Hoare triple {1016#(and (< __VERIFIER_assert_~cond 4) (<= 0 __VERIFIER_assert_~cond) (exists ((aux_div_v_main_~v~0_BEFORE_CALL_1_33 Int)) (and (not (< (mod (+ (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4) __VERIFIER_assert_~cond) 4294967296) 10)) (< (mod (+ 4294967295 (* aux_div_v_main_~v~0_BEFORE_CALL_1_33 4) __VERIFIER_assert_~cond) 4294967296) 10))))} [120] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {895#false} is VALID [2022-04-27 16:54:09,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {895#false} [122] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {895#false} is VALID [2022-04-27 16:54:09,569 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-27 16:54:09,569 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-27 16:54:09,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891825780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 16:54:09,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-27 16:54:09,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 21 [2022-04-27 16:54:09,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558009924] [2022-04-27 16:54:09,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 16:54:09,570 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 16:54:09,570 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 16:54:09,570 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:09,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:54:09,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-27 16:54:09,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 16:54:09,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-27 16:54:09,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2022-04-27 16:54:09,613 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:09,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:09,792 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2022-04-27 16:54:09,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 16:54:09,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-04-27 16:54:09,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 16:54:09,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:09,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-27 16:54:09,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-27 16:54:09,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-27 16:54:09,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 16:54:09,935 INFO L225 Difference]: With dead ends: 47 [2022-04-27 16:54:09,935 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 16:54:09,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2022-04-27 16:54:09,936 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 31 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 16:54:09,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 119 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 18 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-04-27 16:54:09,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 16:54:09,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 16:54:09,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 16:54:09,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:54:09,937 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:54:09,937 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:54:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:09,937 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:54:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:54:09,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:09,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:09,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:54:09,937 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 16:54:09,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 16:54:09,938 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 16:54:09,938 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:54:09,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:09,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 16:54:09,938 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 16:54:09,938 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 16:54:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 16:54:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 16:54:09,938 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2022-04-27 16:54:09,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 16:54:09,938 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 16:54:09,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 16:54:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 16:54:09,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 16:54:09,941 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 16:54:09,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-27 16:54:10,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 16:54:10,148 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1] [2022-04-27 16:54:10,149 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 16:54:10,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 04:54:10 BasicIcfg [2022-04-27 16:54:10,152 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 16:54:10,153 INFO L158 Benchmark]: Toolchain (without parser) took 8006.68ms. Allocated memory was 189.8MB in the beginning and 274.7MB in the end (delta: 84.9MB). Free memory was 136.1MB in the beginning and 221.9MB in the end (delta: -85.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:54:10,153 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 189.8MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 16:54:10,153 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.65ms. Allocated memory was 189.8MB in the beginning and 274.7MB in the end (delta: 84.9MB). Free memory was 135.8MB in the beginning and 245.4MB in the end (delta: -109.6MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. [2022-04-27 16:54:10,153 INFO L158 Benchmark]: Boogie Preprocessor took 39.76ms. Allocated memory is still 274.7MB. Free memory was 245.4MB in the beginning and 244.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-27 16:54:10,154 INFO L158 Benchmark]: RCFGBuilder took 254.18ms. Allocated memory is still 274.7MB. Free memory was 244.2MB in the beginning and 231.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-27 16:54:10,154 INFO L158 Benchmark]: IcfgTransformer took 26.87ms. Allocated memory is still 274.7MB. Free memory was 231.8MB in the beginning and 230.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 16:54:10,154 INFO L158 Benchmark]: TraceAbstraction took 7474.98ms. Allocated memory is still 274.7MB. Free memory was 229.7MB in the beginning and 222.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-04-27 16:54:10,155 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.14ms. Allocated memory is still 189.8MB. Free memory is still 151.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 204.65ms. Allocated memory was 189.8MB in the beginning and 274.7MB in the end (delta: 84.9MB). Free memory was 135.8MB in the beginning and 245.4MB in the end (delta: -109.6MB). Peak memory consumption was 10.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.76ms. Allocated memory is still 274.7MB. Free memory was 245.4MB in the beginning and 244.2MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 254.18ms. Allocated memory is still 274.7MB. Free memory was 244.2MB in the beginning and 231.8MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 26.87ms. Allocated memory is still 274.7MB. Free memory was 231.8MB in the beginning and 230.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 7474.98ms. Allocated memory is still 274.7MB. Free memory was 229.7MB in the beginning and 222.4MB in the end (delta: 7.3MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.4s, OverallIterations: 5, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 256 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 286 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 57 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 339 IncrementalHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 57 mSolverCounterUnsat, 133 mSDtfsCounter, 339 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=4, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 22 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 180 NumberOfCodeBlocks, 164 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 210 ConstructedInterpolants, 2 QuantifiedInterpolants, 651 SizeOfPredicates, 4 NumberOfNonLiveVariables, 234 ConjunctsInSsa, 26 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 100/251 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 16:54:10,181 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...