/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/nla-digbench-scaling/egcd2-ll_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:06:35,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:06:35,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:06:35,056 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:06:35,056 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:06:35,057 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:06:35,060 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:06:35,062 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:06:35,064 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:06:35,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:06:35,069 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:06:35,071 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:06:35,071 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:06:35,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:06:35,074 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:06:35,076 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:06:35,077 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:06:35,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:06:35,080 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:06:35,085 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:06:35,087 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:06:35,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:06:35,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:06:35,089 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:06:35,090 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:06:35,092 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:06:35,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:06:35,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:06:35,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:06:35,093 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:06:35,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:06:35,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:06:35,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:06:35,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:06:35,097 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:06:35,098 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:06:35,098 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:06:35,098 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:06:35,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:06:35,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:06:35,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:06:35,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:06:35,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:06:35,114 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:06:35,115 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:06:35,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:06:35,116 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:06:35,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:06:35,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:06:35,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:06:35,116 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:06:35,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:06:35,117 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:06:35,117 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:06:35,117 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:06:35,117 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:06:35,117 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:06:35,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:06:35,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:06:35,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:06:35,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:06:35,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:06:35,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:06:35,118 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:06:35,119 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:06:35,119 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-07 19:06:35,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:06:35,337 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:06:35,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:06:35,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:06:35,340 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:06:35,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c [2022-04-07 19:06:35,395 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb479c2c/aced193dfc284986937e3d653cd4baba/FLAGaccd05cee [2022-04-07 19:06:35,743 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:06:35,743 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c [2022-04-07 19:06:35,748 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb479c2c/aced193dfc284986937e3d653cd4baba/FLAGaccd05cee [2022-04-07 19:06:35,758 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aeb479c2c/aced193dfc284986937e3d653cd4baba [2022-04-07 19:06:35,760 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:06:35,761 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:06:35,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:06:35,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:06:35,768 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:06:35,769 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:35,770 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ee0818e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35, skipping insertion in model container [2022-04-07 19:06:35,770 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:35,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:06:35,785 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:06:35,922 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c[490,503] [2022-04-07 19:06:35,940 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:06:35,946 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:06:35,954 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd2-ll_unwindbound2.c[490,503] [2022-04-07 19:06:35,962 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:06:35,972 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:06:35,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35 WrapperNode [2022-04-07 19:06:35,972 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:06:35,973 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:06:35,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:06:35,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:06:35,980 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:35,981 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:35,985 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:35,986 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:35,991 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:35,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:36,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:36,007 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:06:36,007 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:06:36,008 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:06:36,008 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:06:36,009 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35" (1/1) ... [2022-04-07 19:06:36,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:06:36,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:36,044 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-07 19:06:36,067 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-07 19:06:36,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:06:36,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:06:36,077 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:06:36,078 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:06:36,078 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:06:36,078 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:06:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:06:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:06:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:06:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:06:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 19:06:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:06:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:06:36,079 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:06:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:06:36,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:06:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:06:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:06:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:06:36,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:06:36,144 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:06:36,145 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:06:36,350 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:06:36,356 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:06:36,356 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-07 19:06:36,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:06:36 BoogieIcfgContainer [2022-04-07 19:06:36,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:06:36,358 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:06:36,358 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:06:36,363 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:06:36,365 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:06:36" (1/1) ... [2022-04-07 19:06:36,368 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:06:36,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:06:36 BasicIcfg [2022-04-07 19:06:36,412 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:06:36,414 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:06:36,414 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:06:36,416 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:06:36,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:06:35" (1/4) ... [2022-04-07 19:06:36,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1319cbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:06:36, skipping insertion in model container [2022-04-07 19:06:36,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:06:35" (2/4) ... [2022-04-07 19:06:36,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1319cbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:06:36, skipping insertion in model container [2022-04-07 19:06:36,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:06:36" (3/4) ... [2022-04-07 19:06:36,418 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1319cbba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:06:36, skipping insertion in model container [2022-04-07 19:06:36,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:06:36" (4/4) ... [2022-04-07 19:06:36,419 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd2-ll_unwindbound2.cJordan [2022-04-07 19:06:36,423 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:06:36,424 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:06:36,468 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:06:36,473 INFO L340 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 [2022-04-07 19:06:36,474 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:06:36,491 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-07 19:06:36,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-07 19:06:36,499 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:36,499 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:36,500 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:36,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:36,508 INFO L85 PathProgramCache]: Analyzing trace with hash -282167495, now seen corresponding path program 1 times [2022-04-07 19:06:36,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:36,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600649984] [2022-04-07 19:06:36,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:36,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:36,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:36,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [143978479] [2022-04-07 19:06:36,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:36,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:36,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:36,636 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-07 19:06:36,638 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-07 19:06:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:36,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-07 19:06:36,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:36,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:36,857 INFO L272 TraceCheckUtils]: 0: Hoare triple {42#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {42#true} is VALID [2022-04-07 19:06:36,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42#true} {42#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {42#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {42#true} is VALID [2022-04-07 19:06:36,859 INFO L272 TraceCheckUtils]: 6: Hoare triple {42#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 19:06:36,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-07 19:06:36,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,859 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {42#true} {42#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 19:06:36,860 INFO L272 TraceCheckUtils]: 11: Hoare triple {42#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 19:06:36,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-07 19:06:36,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,860 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {42#true} {42#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 19:06:36,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {42#true} is VALID [2022-04-07 19:06:36,861 INFO L272 TraceCheckUtils]: 17: Hoare triple {42#true} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 19:06:36,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-07 19:06:36,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,861 INFO L290 TraceCheckUtils]: 20: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,861 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {42#true} {42#true} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 19:06:36,861 INFO L272 TraceCheckUtils]: 22: Hoare triple {42#true} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 19:06:36,862 INFO L290 TraceCheckUtils]: 23: Hoare triple {42#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {42#true} is VALID [2022-04-07 19:06:36,862 INFO L290 TraceCheckUtils]: 24: Hoare triple {42#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,862 INFO L290 TraceCheckUtils]: 25: Hoare triple {42#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {42#true} is VALID [2022-04-07 19:06:36,862 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {42#true} {42#true} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {42#true} is VALID [2022-04-07 19:06:36,863 INFO L290 TraceCheckUtils]: 27: Hoare triple {42#true} [116] L40-2-->L40-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 19:06:36,863 INFO L272 TraceCheckUtils]: 28: Hoare triple {43#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {43#false} is VALID [2022-04-07 19:06:36,863 INFO L290 TraceCheckUtils]: 29: Hoare triple {43#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {43#false} is VALID [2022-04-07 19:06:36,863 INFO L290 TraceCheckUtils]: 30: Hoare triple {43#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 19:06:36,864 INFO L290 TraceCheckUtils]: 31: Hoare triple {43#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#false} is VALID [2022-04-07 19:06:36,865 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:06:36,865 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:06:36,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600649984] [2022-04-07 19:06:36,865 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:36,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143978479] [2022-04-07 19:06:36,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143978479] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:06:36,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:06:36,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-07 19:06:36,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8822958] [2022-04-07 19:06:36,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:06:36,872 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-07 19:06:36,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:36,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:36,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:36,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-07 19:06:36,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:36,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-07 19:06:36,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-07 19:06:36,920 INFO L87 Difference]: Start difference. First operand has 39 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 23 states have internal predecessors, (30), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:37,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:37,001 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-07 19:06:37,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-07 19:06:37,001 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 32 [2022-04-07 19:06:37,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:37,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:37,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-04-07 19:06:37,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:37,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2022-04-07 19:06:37,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2022-04-07 19:06:37,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:37,101 INFO L225 Difference]: With dead ends: 39 [2022-04-07 19:06:37,101 INFO L226 Difference]: Without dead ends: 34 [2022-04-07 19:06:37,104 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-07 19:06:37,111 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:37,113 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:06:37,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-07 19:06:37,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-07 19:06:37,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:37,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:37,149 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:37,150 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:37,157 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-07 19:06:37,157 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-07 19:06:37,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:37,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:37,159 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-07 19:06:37,160 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 34 states. [2022-04-07 19:06:37,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:37,171 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2022-04-07 19:06:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-07 19:06:37,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:37,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:37,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:37,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 20 states have internal predecessors, (23), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:37,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2022-04-07 19:06:37,181 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 32 [2022-04-07 19:06:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:37,181 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2022-04-07 19:06:37,181 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2022-04-07 19:06:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-07 19:06:37,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:37,184 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:37,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-07 19:06:37,402 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-07 19:06:37,402 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:37,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:37,403 INFO L85 PathProgramCache]: Analyzing trace with hash -127828113, now seen corresponding path program 1 times [2022-04-07 19:06:37,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:37,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046477726] [2022-04-07 19:06:37,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:37,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:37,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:37,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2100260249] [2022-04-07 19:06:37,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:37,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:37,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:37,426 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-07 19:06:37,428 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-07 19:06:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:37,490 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 19:06:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:37,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:37,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {280#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {280#true} is VALID [2022-04-07 19:06:37,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {280#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {288#(<= ~counter~0 0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {288#(<= ~counter~0 0)} {280#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {288#(<= ~counter~0 0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {288#(<= ~counter~0 0)} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {288#(<= ~counter~0 0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,743 INFO L272 TraceCheckUtils]: 11: Hoare triple {288#(<= ~counter~0 0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,746 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {288#(<= ~counter~0 0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,751 INFO L272 TraceCheckUtils]: 17: Hoare triple {288#(<= ~counter~0 0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,751 INFO L290 TraceCheckUtils]: 18: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,754 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,755 INFO L272 TraceCheckUtils]: 22: Hoare triple {288#(<= ~counter~0 0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {288#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {288#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {288#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,757 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {288#(<= ~counter~0 0)} {288#(<= ~counter~0 0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {288#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:37,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {288#(<= ~counter~0 0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {367#(<= |main_#t~post6| 0)} is VALID [2022-04-07 19:06:37,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {367#(<= |main_#t~post6| 0)} [119] L40-->L40-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {281#false} is VALID [2022-04-07 19:06:37,759 INFO L272 TraceCheckUtils]: 29: Hoare triple {281#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {281#false} is VALID [2022-04-07 19:06:37,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {281#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {281#false} is VALID [2022-04-07 19:06:37,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {281#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {281#false} is VALID [2022-04-07 19:06:37,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {281#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {281#false} is VALID [2022-04-07 19:06:37,760 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:06:37,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:06:37,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046477726] [2022-04-07 19:06:37,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:37,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100260249] [2022-04-07 19:06:37,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100260249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:06:37,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:06:37,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 19:06:37,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236290928] [2022-04-07 19:06:37,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:06:37,762 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 19:06:37,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:37,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:37,783 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:37,783 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 19:06:37,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:37,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 19:06:37,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 19:06:37,784 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:37,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:37,873 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-07 19:06:37,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 19:06:37,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-07 19:06:37,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:37,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:37,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-07 19:06:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:37,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-07 19:06:37,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-04-07 19:06:37,920 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:37,922 INFO L225 Difference]: With dead ends: 36 [2022-04-07 19:06:37,923 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 19:06:37,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 19:06:37,925 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:37,925 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:06:37,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 19:06:37,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-04-07 19:06:37,932 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:37,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:37,933 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:37,934 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:37,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:37,936 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-07 19:06:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-07 19:06:37,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:37,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:37,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 19:06:37,948 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 36 states. [2022-04-07 19:06:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:37,951 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2022-04-07 19:06:37,951 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-07 19:06:37,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:37,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:37,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:37,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.25) internal successors, (25), 21 states have internal predecessors, (25), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 47 transitions. [2022-04-07 19:06:37,954 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 47 transitions. Word has length 33 [2022-04-07 19:06:37,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:37,954 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 47 transitions. [2022-04-07 19:06:37,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 47 transitions. [2022-04-07 19:06:37,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 19:06:37,955 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:37,955 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:37,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-07 19:06:38,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-07 19:06:38,174 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:38,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:38,175 INFO L85 PathProgramCache]: Analyzing trace with hash 365419517, now seen corresponding path program 1 times [2022-04-07 19:06:38,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:38,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623019922] [2022-04-07 19:06:38,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:38,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:38,193 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:38,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [313320803] [2022-04-07 19:06:38,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:38,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:38,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:38,195 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-07 19:06:38,196 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-07 19:06:38,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:38,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:06:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:38,246 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:38,376 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {526#true} is VALID [2022-04-07 19:06:38,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {526#true} is VALID [2022-04-07 19:06:38,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {526#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID [2022-04-07 19:06:38,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {526#true} {526#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,378 INFO L272 TraceCheckUtils]: 11: Hoare triple {526#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {567#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:06:38,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {567#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:38,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:38,383 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {571#(not (= |assume_abort_if_not_#in~cond| 0))} {526#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {578#(<= 1 main_~y~0)} is VALID [2022-04-07 19:06:38,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,383 INFO L272 TraceCheckUtils]: 17: Hoare triple {582#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID [2022-04-07 19:06:38,384 INFO L290 TraceCheckUtils]: 19: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,384 INFO L290 TraceCheckUtils]: 20: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,384 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,384 INFO L272 TraceCheckUtils]: 22: Hoare triple {582#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID [2022-04-07 19:06:38,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,385 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {582#(<= 1 main_~b~0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {582#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {582#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-07 19:06:38,386 INFO L272 TraceCheckUtils]: 30: Hoare triple {527#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {527#false} is VALID [2022-04-07 19:06:38,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {527#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {527#false} is VALID [2022-04-07 19:06:38,387 INFO L290 TraceCheckUtils]: 32: Hoare triple {527#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-07 19:06:38,387 INFO L290 TraceCheckUtils]: 33: Hoare triple {527#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-07 19:06:38,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 19:06:38,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:06:38,606 INFO L290 TraceCheckUtils]: 33: Hoare triple {527#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-07 19:06:38,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {527#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-07 19:06:38,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {527#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {527#false} is VALID [2022-04-07 19:06:38,607 INFO L272 TraceCheckUtils]: 30: Hoare triple {527#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {527#false} is VALID [2022-04-07 19:06:38,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {582#(<= 1 main_~b~0)} [123] L41-->L40-3: Formula: (= v_main_~b~0_3 0) InVars {main_~b~0=v_main_~b~0_3} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[] {527#false} is VALID [2022-04-07 19:06:38,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {582#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,610 INFO L290 TraceCheckUtils]: 27: Hoare triple {582#(<= 1 main_~b~0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,610 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID [2022-04-07 19:06:38,611 INFO L272 TraceCheckUtils]: 22: Hoare triple {582#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,612 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {526#true} {582#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,612 INFO L290 TraceCheckUtils]: 20: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,612 INFO L290 TraceCheckUtils]: 19: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID [2022-04-07 19:06:38,613 INFO L272 TraceCheckUtils]: 17: Hoare triple {582#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,614 INFO L290 TraceCheckUtils]: 16: Hoare triple {578#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {582#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:38,632 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {571#(not (= |assume_abort_if_not_#in~cond| 0))} {526#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {578#(<= 1 main_~y~0)} is VALID [2022-04-07 19:06:38,634 INFO L290 TraceCheckUtils]: 14: Hoare triple {571#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:38,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {571#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:38,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {697#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 19:06:38,636 INFO L272 TraceCheckUtils]: 11: Hoare triple {526#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {526#true} {526#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {526#true} is VALID [2022-04-07 19:06:38,637 INFO L272 TraceCheckUtils]: 6: Hoare triple {526#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {526#true} is VALID [2022-04-07 19:06:38,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {526#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {526#true} is VALID [2022-04-07 19:06:38,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {526#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {526#true} {526#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {526#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {526#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {526#true} is VALID [2022-04-07 19:06:38,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {526#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {526#true} is VALID [2022-04-07 19:06:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 19:06:38,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:38,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623019922] [2022-04-07 19:06:38,638 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:38,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313320803] [2022-04-07 19:06:38,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [313320803] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:06:38,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:06:38,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2022-04-07 19:06:38,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361822682] [2022-04-07 19:06:38,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:06:38,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 19:06:38,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:38,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:38,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:38,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-07 19:06:38,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:38,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-07 19:06:38,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-07 19:06:38,660 INFO L87 Difference]: Start difference. First operand 36 states and 47 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:38,977 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-07 19:06:38,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:06:38,977 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2022-04-07 19:06:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:38,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-07 19:06:38,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:38,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 63 transitions. [2022-04-07 19:06:38,984 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 63 transitions. [2022-04-07 19:06:39,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:39,032 INFO L225 Difference]: With dead ends: 45 [2022-04-07 19:06:39,032 INFO L226 Difference]: Without dead ends: 45 [2022-04-07 19:06:39,033 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:06:39,033 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 28 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:39,034 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 162 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:06:39,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-07 19:06:39,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2022-04-07 19:06:39,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:39,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:39,042 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:39,042 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:39,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:39,044 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-07 19:06:39,044 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-07 19:06:39,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:39,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:39,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-07 19:06:39,045 INFO L87 Difference]: Start difference. First operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 45 states. [2022-04-07 19:06:39,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:39,048 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2022-04-07 19:06:39,048 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 62 transitions. [2022-04-07 19:06:39,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:39,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:39,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:39,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:39,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 22 states have internal predecessors, (26), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:39,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2022-04-07 19:06:39,050 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 48 transitions. Word has length 34 [2022-04-07 19:06:39,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:39,050 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 48 transitions. [2022-04-07 19:06:39,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:39,051 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2022-04-07 19:06:39,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 19:06:39,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:39,051 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:39,069 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-07 19:06:39,255 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:39,256 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:39,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:39,257 INFO L85 PathProgramCache]: Analyzing trace with hash 196514290, now seen corresponding path program 1 times [2022-04-07 19:06:39,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:39,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482616070] [2022-04-07 19:06:39,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:39,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:39,274 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:39,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [621223722] [2022-04-07 19:06:39,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:39,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:39,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:39,275 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:06:39,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-07 19:06:39,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:39,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 19:06:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:39,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:39,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,523 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {912#true} is VALID [2022-04-07 19:06:39,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,523 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {912#true} is VALID [2022-04-07 19:06:39,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {912#true} is VALID [2022-04-07 19:06:39,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,524 INFO L272 TraceCheckUtils]: 11: Hoare triple {912#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {912#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {953#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:06:39,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {953#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {957#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:39,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {957#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {957#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:39,526 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {957#(not (= |assume_abort_if_not_#in~cond| 0))} {912#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {964#(<= 1 main_~y~0)} is VALID [2022-04-07 19:06:39,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {964#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {968#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:39,527 INFO L272 TraceCheckUtils]: 17: Hoare triple {968#(<= 1 main_~b~0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {912#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {912#true} is VALID [2022-04-07 19:06:39,527 INFO L290 TraceCheckUtils]: 19: Hoare triple {912#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,527 INFO L290 TraceCheckUtils]: 20: Hoare triple {912#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,528 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {912#true} {968#(<= 1 main_~b~0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {968#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:39,528 INFO L272 TraceCheckUtils]: 22: Hoare triple {968#(<= 1 main_~b~0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,528 INFO L290 TraceCheckUtils]: 23: Hoare triple {912#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {912#true} is VALID [2022-04-07 19:06:39,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {912#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,529 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {912#true} {968#(<= 1 main_~b~0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {968#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:39,529 INFO L290 TraceCheckUtils]: 27: Hoare triple {968#(<= 1 main_~b~0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {968#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:39,529 INFO L290 TraceCheckUtils]: 28: Hoare triple {968#(<= 1 main_~b~0)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {968#(<= 1 main_~b~0)} is VALID [2022-04-07 19:06:39,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {968#(<= 1 main_~b~0)} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1008#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-07 19:06:39,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {1008#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1008#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-07 19:06:39,531 INFO L290 TraceCheckUtils]: 31: Hoare triple {1008#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1008#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} is VALID [2022-04-07 19:06:39,531 INFO L272 TraceCheckUtils]: 32: Hoare triple {1008#(and (= main_~c~0 main_~a~0) (= main_~k~0 0) (<= 1 main_~b~0))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1018#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:39,532 INFO L290 TraceCheckUtils]: 33: Hoare triple {1018#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1022#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:39,533 INFO L290 TraceCheckUtils]: 34: Hoare triple {1022#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {913#false} is VALID [2022-04-07 19:06:39,533 INFO L290 TraceCheckUtils]: 35: Hoare triple {913#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#false} is VALID [2022-04-07 19:06:39,533 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 19:06:39,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:06:39,755 INFO L290 TraceCheckUtils]: 35: Hoare triple {913#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {913#false} is VALID [2022-04-07 19:06:39,755 INFO L290 TraceCheckUtils]: 34: Hoare triple {1022#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {913#false} is VALID [2022-04-07 19:06:39,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {1018#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1022#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:39,756 INFO L272 TraceCheckUtils]: 32: Hoare triple {1038#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1018#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:39,757 INFO L290 TraceCheckUtils]: 31: Hoare triple {1038#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1038#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-07 19:06:39,757 INFO L290 TraceCheckUtils]: 30: Hoare triple {1038#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1038#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-07 19:06:39,758 INFO L290 TraceCheckUtils]: 29: Hoare triple {912#true} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1038#(= main_~a~0 (+ main_~c~0 (* main_~b~0 main_~k~0)))} is VALID [2022-04-07 19:06:39,758 INFO L290 TraceCheckUtils]: 28: Hoare triple {912#true} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {912#true} is VALID [2022-04-07 19:06:39,758 INFO L290 TraceCheckUtils]: 27: Hoare triple {912#true} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {912#true} is VALID [2022-04-07 19:06:39,758 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {912#true} {912#true} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,758 INFO L290 TraceCheckUtils]: 25: Hoare triple {912#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {912#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {912#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {912#true} is VALID [2022-04-07 19:06:39,758 INFO L272 TraceCheckUtils]: 22: Hoare triple {912#true} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,758 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {912#true} {912#true} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {912#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {912#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {912#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L272 TraceCheckUtils]: 17: Hoare triple {912#true} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {912#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {912#true} {912#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {912#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L290 TraceCheckUtils]: 13: Hoare triple {912#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {912#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {912#true} is VALID [2022-04-07 19:06:39,759 INFO L272 TraceCheckUtils]: 11: Hoare triple {912#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,760 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {912#true} {912#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {912#true} is VALID [2022-04-07 19:06:39,760 INFO L272 TraceCheckUtils]: 6: Hoare triple {912#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {912#true} is VALID [2022-04-07 19:06:39,760 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {912#true} is VALID [2022-04-07 19:06:39,760 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,760 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,760 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {912#true} is VALID [2022-04-07 19:06:39,761 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {912#true} is VALID [2022-04-07 19:06:39,761 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:06:39,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:39,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482616070] [2022-04-07 19:06:39,761 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:39,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621223722] [2022-04-07 19:06:39,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [621223722] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:06:39,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:06:39,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2022-04-07 19:06:39,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708758027] [2022-04-07 19:06:39,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:06:39,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-07 19:06:39,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:39,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:39,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:39,788 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:06:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:39,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:06:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:06:39,789 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:40,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:40,002 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-07 19:06:40,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:06:40,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 36 [2022-04-07 19:06:40,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:40,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-07 19:06:40,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:40,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-07 19:06:40,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-07 19:06:40,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:40,046 INFO L225 Difference]: With dead ends: 41 [2022-04-07 19:06:40,046 INFO L226 Difference]: Without dead ends: 41 [2022-04-07 19:06:40,046 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:06:40,047 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 7 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:40,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 131 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:06:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-07 19:06:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-04-07 19:06:40,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:40,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:40,050 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:40,050 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:40,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:40,052 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-07 19:06:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-07 19:06:40,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:40,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:40,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-07 19:06:40,053 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 41 states. [2022-04-07 19:06:40,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:40,059 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-07 19:06:40,059 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-07 19:06:40,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:40,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:40,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:40,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2022-04-07 19:06:40,061 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 36 [2022-04-07 19:06:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:40,061 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2022-04-07 19:06:40,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-07 19:06:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2022-04-07 19:06:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-07 19:06:40,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:40,062 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:40,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-07 19:06:40,262 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:40,262 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:40,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:40,263 INFO L85 PathProgramCache]: Analyzing trace with hash 56558454, now seen corresponding path program 1 times [2022-04-07 19:06:40,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:40,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510426569] [2022-04-07 19:06:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:40,276 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:40,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [325588898] [2022-04-07 19:06:40,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:40,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:40,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:40,278 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:06:40,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-07 19:06:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:40,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:06:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:40,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:40,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {1303#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1303#true} is VALID [2022-04-07 19:06:40,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {1311#(<= ~counter~0 0)} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,508 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1311#(<= ~counter~0 0)} {1303#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,508 INFO L272 TraceCheckUtils]: 4: Hoare triple {1311#(<= ~counter~0 0)} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {1311#(<= ~counter~0 0)} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,509 INFO L272 TraceCheckUtils]: 6: Hoare triple {1311#(<= ~counter~0 0)} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {1311#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {1311#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {1311#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,512 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1311#(<= ~counter~0 0)} {1311#(<= ~counter~0 0)} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,512 INFO L272 TraceCheckUtils]: 11: Hoare triple {1311#(<= ~counter~0 0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,512 INFO L290 TraceCheckUtils]: 12: Hoare triple {1311#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,513 INFO L290 TraceCheckUtils]: 13: Hoare triple {1311#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,513 INFO L290 TraceCheckUtils]: 14: Hoare triple {1311#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,514 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1311#(<= ~counter~0 0)} {1311#(<= ~counter~0 0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,514 INFO L290 TraceCheckUtils]: 16: Hoare triple {1311#(<= ~counter~0 0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,514 INFO L272 TraceCheckUtils]: 17: Hoare triple {1311#(<= ~counter~0 0)} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,516 INFO L290 TraceCheckUtils]: 18: Hoare triple {1311#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {1311#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,517 INFO L290 TraceCheckUtils]: 20: Hoare triple {1311#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,518 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1311#(<= ~counter~0 0)} {1311#(<= ~counter~0 0)} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,518 INFO L272 TraceCheckUtils]: 22: Hoare triple {1311#(<= ~counter~0 0)} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,518 INFO L290 TraceCheckUtils]: 23: Hoare triple {1311#(<= ~counter~0 0)} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,519 INFO L290 TraceCheckUtils]: 24: Hoare triple {1311#(<= ~counter~0 0)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {1311#(<= ~counter~0 0)} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,520 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1311#(<= ~counter~0 0)} {1311#(<= ~counter~0 0)} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1311#(<= ~counter~0 0)} is VALID [2022-04-07 19:06:40,520 INFO L290 TraceCheckUtils]: 27: Hoare triple {1311#(<= ~counter~0 0)} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1390#(<= ~counter~0 1)} is VALID [2022-04-07 19:06:40,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {1390#(<= ~counter~0 1)} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1390#(<= ~counter~0 1)} is VALID [2022-04-07 19:06:40,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {1390#(<= ~counter~0 1)} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1390#(<= ~counter~0 1)} is VALID [2022-04-07 19:06:40,527 INFO L290 TraceCheckUtils]: 30: Hoare triple {1390#(<= ~counter~0 1)} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1400#(<= |main_#t~post7| 1)} is VALID [2022-04-07 19:06:40,528 INFO L290 TraceCheckUtils]: 31: Hoare triple {1400#(<= |main_#t~post7| 1)} [135] L46-1-->L46-4: Formula: (not (< |v_main_#t~post7_3| 2)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1304#false} is VALID [2022-04-07 19:06:40,528 INFO L290 TraceCheckUtils]: 32: Hoare triple {1304#false} [134] L46-4-->L40-2: Formula: (and (= v_main_~s~0_5 (+ (* (- 1) (* v_main_~k~0_7 v_main_~s~0_6)) v_main_~temp~0_1)) (= v_main_~c~0_8 v_main_~b~0_10) (= v_main_~p~0_5 (+ v_main_~q~0_5 (* v_main_~k~0_7 v_main_~q~0_6))) (= v_main_~p~0_4 v_main_~q~0_6) (= v_main_~r~0_5 v_main_~temp~0_1) (= v_main_~r~0_4 v_main_~s~0_6) (= v_main_~a~0_6 v_main_~b~0_11)) InVars {main_~q~0=v_main_~q~0_6, main_~k~0=v_main_~k~0_7, main_~c~0=v_main_~c~0_8, main_~b~0=v_main_~b~0_11, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_7, main_~c~0=v_main_~c~0_8, main_~b~0=v_main_~b~0_10, main_~p~0=v_main_~p~0_4, main_~r~0=v_main_~r~0_4, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1304#false} is VALID [2022-04-07 19:06:40,528 INFO L290 TraceCheckUtils]: 33: Hoare triple {1304#false} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1304#false} is VALID [2022-04-07 19:06:40,528 INFO L290 TraceCheckUtils]: 34: Hoare triple {1304#false} [119] L40-->L40-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1304#false} is VALID [2022-04-07 19:06:40,528 INFO L272 TraceCheckUtils]: 35: Hoare triple {1304#false} [118] L40-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* v_main_~q~0_10 v_main_~x~0_15) (* v_main_~s~0_10 v_main_~y~0_15)) 0) 1 0)) InVars {main_~q~0=v_main_~q~0_10, main_~y~0=v_main_~y~0_15, main_~x~0=v_main_~x~0_15, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~s~0] {1304#false} is VALID [2022-04-07 19:06:40,529 INFO L290 TraceCheckUtils]: 36: Hoare triple {1304#false} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1304#false} is VALID [2022-04-07 19:06:40,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {1304#false} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1304#false} is VALID [2022-04-07 19:06:40,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {1304#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#false} is VALID [2022-04-07 19:06:40,529 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:06:40,529 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:06:40,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:40,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510426569] [2022-04-07 19:06:40,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:40,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [325588898] [2022-04-07 19:06:40,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [325588898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:06:40,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:06:40,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:06:40,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723855986] [2022-04-07 19:06:40,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:06:40,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-07 19:06:40,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:40,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:40,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:40,553 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:06:40,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:40,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:06:40,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:06:40,554 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:40,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:40,667 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-07 19:06:40,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:06:40,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-07 19:06:40,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:40,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:40,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 19:06:40,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:40,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 19:06:40,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-07 19:06:40,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:40,713 INFO L225 Difference]: With dead ends: 43 [2022-04-07 19:06:40,713 INFO L226 Difference]: Without dead ends: 43 [2022-04-07 19:06:40,713 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:06:40,715 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:40,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 133 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:06:40,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-07 19:06:40,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-04-07 19:06:40,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:40,726 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:40,726 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:40,726 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:40,728 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-07 19:06:40,729 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-07 19:06:40,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:40,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:40,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-07 19:06:40,729 INFO L87 Difference]: Start difference. First operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 43 states. [2022-04-07 19:06:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:40,731 INFO L93 Difference]: Finished difference Result 43 states and 53 transitions. [2022-04-07 19:06:40,731 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-07 19:06:40,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:40,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:40,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:40,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:40,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 27 states have internal predecessors, (31), 12 states have call successors, (12), 5 states have call predecessors, (12), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-07 19:06:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2022-04-07 19:06:40,737 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 39 [2022-04-07 19:06:40,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:40,739 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2022-04-07 19:06:40,739 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:06:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2022-04-07 19:06:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 19:06:40,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:40,741 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:40,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-07 19:06:40,958 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:40,959 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:40,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash 578094295, now seen corresponding path program 1 times [2022-04-07 19:06:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:40,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893085420] [2022-04-07 19:06:40,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:40,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:40,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [19185581] [2022-04-07 19:06:40,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:40,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:40,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:40,975 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:06:40,978 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-07 19:06:41,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:41,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 19:06:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:41,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:41,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {1596#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1596#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1596#true} is VALID [2022-04-07 19:06:41,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1596#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1596#true} {1596#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {1596#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1596#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {1596#true} is VALID [2022-04-07 19:06:41,312 INFO L272 TraceCheckUtils]: 6: Hoare triple {1596#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1596#true} is VALID [2022-04-07 19:06:41,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1596#true} {1596#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,313 INFO L272 TraceCheckUtils]: 11: Hoare triple {1596#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1637#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:06:41,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {1637#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1641#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:41,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {1641#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1641#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:41,317 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1641#(not (= |assume_abort_if_not_#in~cond| 0))} {1596#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1648#(<= 1 main_~y~0)} is VALID [2022-04-07 19:06:41,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {1648#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:41,318 INFO L272 TraceCheckUtils]: 17: Hoare triple {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {1596#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1596#true} is VALID [2022-04-07 19:06:41,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,320 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1596#true} {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:41,320 INFO L272 TraceCheckUtils]: 22: Hoare triple {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {1596#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1596#true} is VALID [2022-04-07 19:06:41,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {1596#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {1596#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,321 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1596#true} {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:41,321 INFO L290 TraceCheckUtils]: 27: Hoare triple {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:41,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:41,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:41,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:41,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:41,323 INFO L272 TraceCheckUtils]: 32: Hoare triple {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1596#true} is VALID [2022-04-07 19:06:41,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {1596#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1596#true} is VALID [2022-04-07 19:06:41,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {1596#true} [127] L11-->L11-2: Formula: (not (= 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[] {1596#true} is VALID [2022-04-07 19:06:41,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {1596#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,324 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1596#true} {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:06:41,325 INFO L272 TraceCheckUtils]: 37: Hoare triple {1652#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1716#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:41,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {1716#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1720#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:41,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {1720#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1597#false} is VALID [2022-04-07 19:06:41,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {1597#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#false} is VALID [2022-04-07 19:06:41,326 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-04-07 19:06:41,326 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:06:41,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {1597#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1597#false} is VALID [2022-04-07 19:06:41,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {1720#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1597#false} is VALID [2022-04-07 19:06:41,518 INFO L290 TraceCheckUtils]: 38: Hoare triple {1716#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1720#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:41,518 INFO L272 TraceCheckUtils]: 37: Hoare triple {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1716#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:41,519 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1596#true} {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:41,519 INFO L290 TraceCheckUtils]: 35: Hoare triple {1596#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {1596#true} [127] L11-->L11-2: Formula: (not (= 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[] {1596#true} is VALID [2022-04-07 19:06:41,519 INFO L290 TraceCheckUtils]: 33: Hoare triple {1596#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1596#true} is VALID [2022-04-07 19:06:41,519 INFO L272 TraceCheckUtils]: 32: Hoare triple {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {1596#true} is VALID [2022-04-07 19:06:41,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:41,520 INFO L290 TraceCheckUtils]: 30: Hoare triple {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:41,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:41,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:41,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:41,522 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {1596#true} {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:41,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {1596#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {1596#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,522 INFO L290 TraceCheckUtils]: 23: Hoare triple {1596#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1596#true} is VALID [2022-04-07 19:06:41,522 INFO L272 TraceCheckUtils]: 22: Hoare triple {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,524 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1596#true} {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:41,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {1596#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {1596#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,524 INFO L290 TraceCheckUtils]: 18: Hoare triple {1596#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1596#true} is VALID [2022-04-07 19:06:41,524 INFO L272 TraceCheckUtils]: 17: Hoare triple {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {1596#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1736#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:06:41,525 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1596#true} {1596#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L290 TraceCheckUtils]: 14: Hoare triple {1596#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {1596#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {1596#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L272 TraceCheckUtils]: 11: Hoare triple {1596#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1596#true} {1596#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {1596#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {1596#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {1596#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {1596#true} is VALID [2022-04-07 19:06:41,525 INFO L272 TraceCheckUtils]: 6: Hoare triple {1596#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {1596#true} is VALID [2022-04-07 19:06:41,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {1596#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {1596#true} is VALID [2022-04-07 19:06:41,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {1596#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1596#true} {1596#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {1596#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {1596#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {1596#true} is VALID [2022-04-07 19:06:41,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {1596#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1596#true} is VALID [2022-04-07 19:06:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-07 19:06:41,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:41,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893085420] [2022-04-07 19:06:41,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:41,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19185581] [2022-04-07 19:06:41,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [19185581] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:06:41,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:06:41,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-07 19:06:41,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772331116] [2022-04-07 19:06:41,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:06:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-07 19:06:41,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:41,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:06:41,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:41,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:06:41,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:41,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:06:41,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:06:41,552 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:06:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:41,834 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-07 19:06:41,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:06:41,834 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 41 [2022-04-07 19:06:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:41,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:06:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 19:06:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:06:41,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 19:06:41,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-07 19:06:41,899 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:41,901 INFO L225 Difference]: With dead ends: 55 [2022-04-07 19:06:41,902 INFO L226 Difference]: Without dead ends: 55 [2022-04-07 19:06:41,902 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:06:41,904 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 8 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:41,904 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 157 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:06:41,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-07 19:06:41,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2022-04-07 19:06:41,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:41,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:06:41,917 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:06:41,917 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:06:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:41,919 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-07 19:06:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-07 19:06:41,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:41,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:41,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-07 19:06:41,922 INFO L87 Difference]: Start difference. First operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 55 states. [2022-04-07 19:06:41,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:41,925 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2022-04-07 19:06:41,925 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-04-07 19:06:41,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:41,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:41,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:41,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:41,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 16 states have call successors, (16), 6 states have call predecessors, (16), 5 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:06:41,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-04-07 19:06:41,928 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 41 [2022-04-07 19:06:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:41,928 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-04-07 19:06:41,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-04-07 19:06:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-04-07 19:06:41,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-07 19:06:41,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:41,930 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:41,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-07 19:06:42,138 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:42,138 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:42,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:42,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1581112078, now seen corresponding path program 1 times [2022-04-07 19:06:42,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:42,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460231042] [2022-04-07 19:06:42,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:42,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:42,152 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:42,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839065683] [2022-04-07 19:06:42,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:42,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:42,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:42,154 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:06:42,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-07 19:06:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:42,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-07 19:06:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:42,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:42,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {2071#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {2071#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2071#true} is VALID [2022-04-07 19:06:42,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {2071#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,452 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2071#true} {2071#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,452 INFO L272 TraceCheckUtils]: 4: Hoare triple {2071#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {2071#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {2071#true} is VALID [2022-04-07 19:06:42,452 INFO L272 TraceCheckUtils]: 6: Hoare triple {2071#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {2071#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2097#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:06:42,455 INFO L290 TraceCheckUtils]: 8: Hoare triple {2097#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2101#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:42,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {2101#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2101#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:42,456 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2101#(not (= |assume_abort_if_not_#in~cond| 0))} {2071#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2108#(<= 1 main_~x~0)} is VALID [2022-04-07 19:06:42,456 INFO L272 TraceCheckUtils]: 11: Hoare triple {2108#(<= 1 main_~x~0)} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {2071#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2071#true} is VALID [2022-04-07 19:06:42,456 INFO L290 TraceCheckUtils]: 13: Hoare triple {2071#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,456 INFO L290 TraceCheckUtils]: 14: Hoare triple {2071#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,456 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2071#true} {2108#(<= 1 main_~x~0)} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2108#(<= 1 main_~x~0)} is VALID [2022-04-07 19:06:42,457 INFO L290 TraceCheckUtils]: 16: Hoare triple {2108#(<= 1 main_~x~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,457 INFO L272 TraceCheckUtils]: 17: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {2071#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2071#true} is VALID [2022-04-07 19:06:42,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {2071#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {2071#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,458 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2071#true} {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,458 INFO L272 TraceCheckUtils]: 22: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {2071#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2071#true} is VALID [2022-04-07 19:06:42,458 INFO L290 TraceCheckUtils]: 24: Hoare triple {2071#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,458 INFO L290 TraceCheckUtils]: 25: Hoare triple {2071#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,459 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2071#true} {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,461 INFO L272 TraceCheckUtils]: 32: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2071#true} is VALID [2022-04-07 19:06:42,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {2071#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2071#true} is VALID [2022-04-07 19:06:42,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {2071#true} [127] L11-->L11-2: Formula: (not (= 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[] {2071#true} is VALID [2022-04-07 19:06:42,461 INFO L290 TraceCheckUtils]: 35: Hoare triple {2071#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,461 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2071#true} {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,462 INFO L272 TraceCheckUtils]: 37: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2071#true} is VALID [2022-04-07 19:06:42,462 INFO L290 TraceCheckUtils]: 38: Hoare triple {2071#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2071#true} is VALID [2022-04-07 19:06:42,462 INFO L290 TraceCheckUtils]: 39: Hoare triple {2071#true} [127] L11-->L11-2: Formula: (not (= 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[] {2071#true} is VALID [2022-04-07 19:06:42,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {2071#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,462 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2071#true} {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [150] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-07 19:06:42,463 INFO L272 TraceCheckUtils]: 42: Hoare triple {2127#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [139] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_13 v_main_~q~0_8) (* v_main_~y~0_13 v_main_~s~0_8)) v_main_~b~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_13, main_~s~0=v_main_~s~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:42,463 INFO L290 TraceCheckUtils]: 43: Hoare triple {2206#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:42,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {2210#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2072#false} is VALID [2022-04-07 19:06:42,464 INFO L290 TraceCheckUtils]: 45: Hoare triple {2072#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2072#false} is VALID [2022-04-07 19:06:42,464 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-07 19:06:42,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:06:42,668 INFO L290 TraceCheckUtils]: 45: Hoare triple {2072#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2072#false} is VALID [2022-04-07 19:06:42,669 INFO L290 TraceCheckUtils]: 44: Hoare triple {2210#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2072#false} is VALID [2022-04-07 19:06:42,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {2206#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2210#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:42,670 INFO L272 TraceCheckUtils]: 42: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [139] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_13 v_main_~q~0_8) (* v_main_~y~0_13 v_main_~s~0_8)) v_main_~b~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_13, main_~s~0=v_main_~s~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2206#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:42,671 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2071#true} {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [150] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,671 INFO L290 TraceCheckUtils]: 40: Hoare triple {2071#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,671 INFO L290 TraceCheckUtils]: 39: Hoare triple {2071#true} [127] L11-->L11-2: Formula: (not (= 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[] {2071#true} is VALID [2022-04-07 19:06:42,671 INFO L290 TraceCheckUtils]: 38: Hoare triple {2071#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2071#true} is VALID [2022-04-07 19:06:42,672 INFO L272 TraceCheckUtils]: 37: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2071#true} is VALID [2022-04-07 19:06:42,673 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2071#true} {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,673 INFO L290 TraceCheckUtils]: 35: Hoare triple {2071#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {2071#true} [127] L11-->L11-2: Formula: (not (= 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[] {2071#true} is VALID [2022-04-07 19:06:42,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {2071#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2071#true} is VALID [2022-04-07 19:06:42,675 INFO L272 TraceCheckUtils]: 32: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2071#true} is VALID [2022-04-07 19:06:42,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,677 INFO L290 TraceCheckUtils]: 27: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,677 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2071#true} {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,678 INFO L290 TraceCheckUtils]: 25: Hoare triple {2071#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,678 INFO L290 TraceCheckUtils]: 24: Hoare triple {2071#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {2071#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2071#true} is VALID [2022-04-07 19:06:42,678 INFO L272 TraceCheckUtils]: 22: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,678 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2071#true} {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {2071#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,679 INFO L290 TraceCheckUtils]: 19: Hoare triple {2071#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,679 INFO L290 TraceCheckUtils]: 18: Hoare triple {2071#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2071#true} is VALID [2022-04-07 19:06:42,679 INFO L272 TraceCheckUtils]: 17: Hoare triple {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,679 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#true} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2226#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:06:42,679 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2071#true} {2071#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {2071#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {2071#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {2071#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L272 TraceCheckUtils]: 11: Hoare triple {2071#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2071#true} {2071#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {2071#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {2071#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {2071#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L272 TraceCheckUtils]: 6: Hoare triple {2071#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {2071#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {2071#true} is VALID [2022-04-07 19:06:42,680 INFO L272 TraceCheckUtils]: 4: Hoare triple {2071#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2071#true} {2071#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {2071#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {2071#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2071#true} is VALID [2022-04-07 19:06:42,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {2071#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2071#true} is VALID [2022-04-07 19:06:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-07 19:06:42,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:06:42,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460231042] [2022-04-07 19:06:42,681 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:06:42,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839065683] [2022-04-07 19:06:42,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839065683] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-07 19:06:42,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:06:42,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-07 19:06:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444582255] [2022-04-07 19:06:42,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:06:42,683 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-07 19:06:42,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:06:42,684 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:06:42,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:42,706 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:06:42,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:06:42,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:06:42,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:06:42,706 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:06:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:42,941 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-07 19:06:42,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:06:42,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 46 [2022-04-07 19:06:42,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:06:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:06:42,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 19:06:42,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:06:42,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 66 transitions. [2022-04-07 19:06:42,945 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 66 transitions. [2022-04-07 19:06:42,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:06:42,993 INFO L225 Difference]: With dead ends: 59 [2022-04-07 19:06:42,993 INFO L226 Difference]: Without dead ends: 59 [2022-04-07 19:06:42,994 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:06:42,994 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 8 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:06:42,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 148 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:06:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-04-07 19:06:42,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-04-07 19:06:42,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:06:42,997 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:06:42,997 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:06:42,998 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:06:42,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:42,999 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-07 19:06:42,999 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-07 19:06:43,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:43,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:43,000 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-07 19:06:43,000 INFO L87 Difference]: Start difference. First operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 59 states. [2022-04-07 19:06:43,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:06:43,002 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2022-04-07 19:06:43,002 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 73 transitions. [2022-04-07 19:06:43,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:06:43,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:06:43,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:06:43,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:06:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 16 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:06:43,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 72 transitions. [2022-04-07 19:06:43,005 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 72 transitions. Word has length 46 [2022-04-07 19:06:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:06:43,005 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 72 transitions. [2022-04-07 19:06:43,005 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-07 19:06:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2022-04-07 19:06:43,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-07 19:06:43,006 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:06:43,006 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:06:43,027 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-07 19:06:43,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:43,220 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:06:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:06:43,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1942645143, now seen corresponding path program 1 times [2022-04-07 19:06:43,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:06:43,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547179314] [2022-04-07 19:06:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:06:43,232 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:06:43,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327191302] [2022-04-07 19:06:43,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:06:43,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:06:43,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:06:43,235 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:06:43,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-07 19:06:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:43,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-07 19:06:43,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:06:43,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:06:43,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {2592#true} [101] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,655 INFO L290 TraceCheckUtils]: 1: Hoare triple {2592#true} [103] 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) (= (select |v_#length_1| 2) 11) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= v_~counter~0_5 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_5, #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[~counter~0, #NULL.offset, #NULL.base] {2592#true} is VALID [2022-04-07 19:06:43,655 INFO L290 TraceCheckUtils]: 2: Hoare triple {2592#true} [106] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,655 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2592#true} {2592#true} [143] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,655 INFO L272 TraceCheckUtils]: 4: Hoare triple {2592#true} [102] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,655 INFO L290 TraceCheckUtils]: 5: Hoare triple {2592#true} [105] mainENTRY-->L24: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_1 |v_main_#t~nondet4_2|) (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648)) (= v_main_~y~0_1 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~q~0=v_main_~q~0_1, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_1, main_~s~0=v_main_~s~0_1, main_~yy~0=v_main_~yy~0_1, main_~k~0=v_main_~k~0_1, main_~xy~0=v_main_~xy~0_1, main_~c~0=v_main_~c~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~s~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~p~0, main_~r~0, main_~a~0] {2592#true} is VALID [2022-04-07 19:06:43,656 INFO L272 TraceCheckUtils]: 6: Hoare triple {2592#true} [107] L24-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2592#true} is VALID [2022-04-07 19:06:43,656 INFO L290 TraceCheckUtils]: 7: Hoare triple {2592#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2592#true} is VALID [2022-04-07 19:06:43,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {2592#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,656 INFO L290 TraceCheckUtils]: 9: Hoare triple {2592#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,656 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2592#true} {2592#true} [144] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~x~0_11) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~x~0=v_main_~x~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~x~0, assume_abort_if_not_#in~cond] {2592#true} is VALID [2022-04-07 19:06:43,656 INFO L272 TraceCheckUtils]: 11: Hoare triple {2592#true} [108] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2592#true} is VALID [2022-04-07 19:06:43,656 INFO L290 TraceCheckUtils]: 12: Hoare triple {2592#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2633#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:06:43,657 INFO L290 TraceCheckUtils]: 13: Hoare triple {2633#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2637#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:43,657 INFO L290 TraceCheckUtils]: 14: Hoare triple {2637#(not (= |assume_abort_if_not_#in~cond| 0))} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2637#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:06:43,658 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2637#(not (= |assume_abort_if_not_#in~cond| 0))} {2592#true} [145] assume_abort_if_notEXIT-->L25: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_11) 1 0)) InVars {main_~y~0=v_main_~y~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~y~0, assume_abort_if_not_#in~cond] {2644#(<= 1 main_~y~0)} is VALID [2022-04-07 19:06:43,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {2644#(<= 1 main_~y~0)} [110] L25-->L37: Formula: (and (= v_main_~yy~0_2 (* v_main_~y~0_5 v_main_~y~0_5)) (= v_main_~s~0_2 1) (= v_main_~b~0_2 v_main_~y~0_5) (= v_main_~c~0_2 0) (= v_main_~r~0_2 0) (= v_main_~q~0_2 0) (= v_main_~k~0_2 0) (= v_main_~a~0_2 v_main_~x~0_5) (= v_main_~xy~0_2 (* v_main_~x~0_5 v_main_~y~0_5)) (= v_main_~p~0_2 1)) InVars {main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5} OutVars{main_~q~0=v_main_~q~0_2, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~s~0=v_main_~s~0_2, main_~yy~0=v_main_~yy~0_2, main_~k~0=v_main_~k~0_2, main_~xy~0=v_main_~xy~0_2, main_~c~0=v_main_~c~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, main_~k~0, main_~xy~0, main_~c~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,658 INFO L272 TraceCheckUtils]: 17: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [113] L37-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2592#true} is VALID [2022-04-07 19:06:43,658 INFO L290 TraceCheckUtils]: 18: Hoare triple {2592#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2592#true} is VALID [2022-04-07 19:06:43,658 INFO L290 TraceCheckUtils]: 19: Hoare triple {2592#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,658 INFO L290 TraceCheckUtils]: 20: Hoare triple {2592#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,659 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2592#true} {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [146] assume_abort_if_notEXIT-->L37-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< v_main_~xy~0_5 2147483647) 1 0)) InVars {main_~xy~0=v_main_~xy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~xy~0, assume_abort_if_not_#in~cond] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,659 INFO L272 TraceCheckUtils]: 22: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [115] L37-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2592#true} is VALID [2022-04-07 19:06:43,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {2592#true} [109] assume_abort_if_notENTRY-->L8: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {2592#true} is VALID [2022-04-07 19:06:43,659 INFO L290 TraceCheckUtils]: 24: Hoare triple {2592#true} [112] L8-->L8-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {2592#true} [114] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,660 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {2592#true} {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [147] assume_abort_if_notEXIT-->L40-2: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (< v_main_~yy~0_5 2147483647) 1 0)) InVars {main_~yy~0=v_main_~yy~0_5} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~yy~0, assume_abort_if_not_#in~cond] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [117] L40-2-->L40: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [120] L40-->L41: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [124] L41-->L46-3: Formula: (and (= v_main_~k~0_3 0) (= v_main_~a~0_3 v_main_~c~0_3) (not (= v_main_~b~0_4 0))) InVars {main_~b~0=v_main_~b~0_4, main_~a~0=v_main_~a~0_3} OutVars{main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_4, main_~k~0=v_main_~k~0_3, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,662 INFO L290 TraceCheckUtils]: 30: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [129] L46-3-->L46-1: Formula: (and (= |v_main_#t~post7_1| v_~counter~0_4) (= (+ |v_main_#t~post7_1| 1) v_~counter~0_3)) InVars {~counter~0=v_~counter~0_4} OutVars{~counter~0=v_~counter~0_3, main_#t~post7=|v_main_#t~post7_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post7] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [136] L46-1-->L47: Formula: (< |v_main_#t~post7_5| 2) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,662 INFO L272 TraceCheckUtils]: 32: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [137] L47-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2592#true} is VALID [2022-04-07 19:06:43,662 INFO L290 TraceCheckUtils]: 33: Hoare triple {2592#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2592#true} is VALID [2022-04-07 19:06:43,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {2592#true} [127] L11-->L11-2: Formula: (not (= 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[] {2592#true} is VALID [2022-04-07 19:06:43,662 INFO L290 TraceCheckUtils]: 35: Hoare triple {2592#true} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2592#true} is VALID [2022-04-07 19:06:43,663 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2592#true} {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [149] __VERIFIER_assertEXIT-->L47-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_8 v_main_~b~0_12) v_main_~c~0_9)) 1 0)) InVars {main_~c~0=v_main_~c~0_9, main_~b~0=v_main_~b~0_12, main_~k~0=v_main_~k~0_8, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,663 INFO L272 TraceCheckUtils]: 37: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [138] L47-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2592#true} is VALID [2022-04-07 19:06:43,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {2592#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2715#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:43,664 INFO L290 TraceCheckUtils]: 39: Hoare triple {2715#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [127] L11-->L11-2: Formula: (not (= 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[] {2719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:06:43,664 INFO L290 TraceCheckUtils]: 40: Hoare triple {2719#(not (= |__VERIFIER_assert_#in~cond| 0))} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:06:43,664 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2719#(not (= |__VERIFIER_assert_#in~cond| 0))} {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [150] __VERIFIER_assertEXIT-->L48: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_7) (* v_main_~x~0_12 v_main_~p~0_7)) v_main_~a~0_10) 1 0)) InVars {main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,665 INFO L272 TraceCheckUtils]: 42: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [139] L48-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~x~0_13 v_main_~q~0_8) (* v_main_~y~0_13 v_main_~s~0_8)) v_main_~b~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_13, main_~s~0=v_main_~s~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2592#true} is VALID [2022-04-07 19:06:43,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {2592#true} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2715#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:43,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {2715#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [127] L11-->L11-2: Formula: (not (= 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[] {2719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:06:43,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {2719#(not (= |__VERIFIER_assert_#in~cond| 0))} [133] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2719#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:06:43,666 INFO L284 TraceCheckUtils]: 46: Hoare quadruple {2719#(not (= |__VERIFIER_assert_#in~cond| 0))} {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [151] __VERIFIER_assertEXIT-->L49: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~x~0_13 v_main_~q~0_8) (* v_main_~y~0_13 v_main_~s~0_8)) v_main_~b~0_13) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_8, main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_13, main_~s~0=v_main_~s~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:06:43,667 INFO L272 TraceCheckUtils]: 47: Hoare triple {2648#(and (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~yy~0 (* main_~y~0 main_~y~0)) (= main_~q~0 0) (<= 1 main_~y~0))} [140] L49-->__VERIFIER_assertENTRY: Formula: (= (ite (= 0 (+ (* v_main_~xy~0_6 v_main_~q~0_9) (* (- 1) (* v_main_~y~0_14 v_main_~s~0_9)) (* v_main_~yy~0_6 v_main_~s~0_9) (* (- 1) (* v_main_~x~0_14 v_main_~q~0_9)) (* (- 1) (* v_main_~y~0_14 v_main_~b~0_14)) v_main_~b~0_14)) 1 0) |v___VERIFIER_assert_#in~condInParam_4|) InVars {main_~q~0=v_main_~q~0_9, main_~yy~0=v_main_~yy~0_6, main_~x~0=v_main_~x~0_14, main_~xy~0=v_main_~xy~0_6, main_~y~0=v_main_~y~0_14, main_~b~0=v_main_~b~0_14, main_~s~0=v_main_~s~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[main_~q~0, main_~yy~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~xy~0, main_~y~0, main_~b~0, main_~s~0] {2744#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:06:43,667 INFO L290 TraceCheckUtils]: 48: Hoare triple {2744#(<= 1 |__VERIFIER_assert_#in~cond|)} [122] __VERIFIER_assertENTRY-->L11: Formula: (= v___VERIFIER_assert_~cond_1 |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_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {2748#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:06:43,667 INFO L290 TraceCheckUtils]: 49: Hoare triple {2748#(<= 1 __VERIFIER_assert_~cond)} [126] L11-->L12: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {2593#false} is VALID [2022-04-07 19:06:43,667 INFO L290 TraceCheckUtils]: 50: Hoare triple {2593#false} [131] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2593#false} is VALID [2022-04-07 19:06:43,668 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-04-07 19:06:43,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:07:27,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:07:27,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547179314] [2022-04-07 19:07:27,045 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:07:27,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327191302] [2022-04-07 19:07:27,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327191302] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-07 19:07:27,045 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-07 19:07:27,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2022-04-07 19:07:27,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209012174] [2022-04-07 19:07:27,046 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-04-07 19:07:27,046 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-07 19:07:27,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:07:27,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:07:27,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:07:27,080 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 19:07:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:07:27,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 19:07:27,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-07 19:07:27,081 INFO L87 Difference]: Start difference. First operand 58 states and 72 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:07:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:07:28,519 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-07 19:07:28,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 19:07:28,519 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 51 [2022-04-07 19:07:28,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:07:28,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:07:28,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-07 19:07:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:07:28,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 66 transitions. [2022-04-07 19:07:28,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 66 transitions. [2022-04-07 19:07:28,584 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:07:28,585 INFO L225 Difference]: With dead ends: 63 [2022-04-07 19:07:28,585 INFO L226 Difference]: Without dead ends: 63 [2022-04-07 19:07:28,586 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2022-04-07 19:07:28,586 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 35 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-07 19:07:28,586 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 140 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-07 19:07:28,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-07 19:07:28,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-07 19:07:28,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:07:28,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:07:28,589 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:07:28,589 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:07:28,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:07:28,591 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-07 19:07:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-07 19:07:28,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:07:28,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:07:28,592 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-07 19:07:28,592 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 63 states. [2022-04-07 19:07:28,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:07:28,594 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2022-04-07 19:07:28,594 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-07 19:07:28,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:07:28,594 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:07:28,594 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:07:28,594 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:07:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 39 states have internal predecessors, (45), 16 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-07 19:07:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 75 transitions. [2022-04-07 19:07:28,596 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 75 transitions. Word has length 51 [2022-04-07 19:07:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:07:28,596 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 75 transitions. [2022-04-07 19:07:28,597 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 8 states have internal predecessors, (24), 2 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-04-07 19:07:28,597 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 75 transitions. [2022-04-07 19:07:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-07 19:07:28,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:07:28,597 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:07:28,615 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-07 19:07:28,811 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-07 19:07:28,812 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:07:28,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:07:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1573186588, now seen corresponding path program 1 times [2022-04-07 19:07:28,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:07:28,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920479710] [2022-04-07 19:07:28,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:07:28,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:07:28,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:07:28,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553201588] [2022-04-07 19:07:28,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:07:28,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:07:28,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:07:28,838 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-07 19:07:28,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-07 19:07:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:07:28,885 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 19:07:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:07:28,944 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 19:07:28,944 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 19:07:28,945 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 19:07:28,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-07 19:07:29,167 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:07:29,170 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:07:29,172 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 19:07:29,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:07:29 BasicIcfg [2022-04-07 19:07:29,200 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 19:07:29,201 INFO L158 Benchmark]: Toolchain (without parser) took 53439.92ms. Allocated memory was 163.6MB in the beginning and 241.2MB in the end (delta: 77.6MB). Free memory was 112.6MB in the beginning and 162.7MB in the end (delta: -50.1MB). Peak memory consumption was 27.5MB. Max. memory is 8.0GB. [2022-04-07 19:07:29,201 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 163.6MB. Free memory was 128.9MB in the beginning and 128.8MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:07:29,201 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.00ms. Allocated memory was 163.6MB in the beginning and 200.3MB in the end (delta: 36.7MB). Free memory was 112.4MB in the beginning and 175.4MB in the end (delta: -63.0MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-07 19:07:29,201 INFO L158 Benchmark]: Boogie Preprocessor took 34.08ms. Allocated memory is still 200.3MB. Free memory was 175.4MB in the beginning and 173.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:07:29,201 INFO L158 Benchmark]: RCFGBuilder took 350.28ms. Allocated memory is still 200.3MB. Free memory was 173.3MB in the beginning and 159.9MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-04-07 19:07:29,201 INFO L158 Benchmark]: IcfgTransformer took 54.06ms. Allocated memory is still 200.3MB. Free memory was 159.9MB in the beginning and 157.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:07:29,202 INFO L158 Benchmark]: TraceAbstraction took 52786.19ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 157.2MB in the beginning and 162.7MB in the end (delta: -5.5MB). Peak memory consumption was 35.8MB. Max. memory is 8.0GB. [2022-04-07 19:07:29,203 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 163.6MB. Free memory was 128.9MB in the beginning and 128.8MB in the end (delta: 74.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.00ms. Allocated memory was 163.6MB in the beginning and 200.3MB in the end (delta: 36.7MB). Free memory was 112.4MB in the beginning and 175.4MB in the end (delta: -63.0MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.08ms. Allocated memory is still 200.3MB. Free memory was 175.4MB in the beginning and 173.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 350.28ms. Allocated memory is still 200.3MB. Free memory was 173.3MB in the beginning and 159.9MB in the end (delta: 13.4MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * IcfgTransformer took 54.06ms. Allocated memory is still 200.3MB. Free memory was 159.9MB in the beginning and 157.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 52786.19ms. Allocated memory was 200.3MB in the beginning and 241.2MB in the end (delta: 40.9MB). Free memory was 157.2MB in the beginning and 162.7MB in the end (delta: -5.5MB). Peak memory consumption was 35.8MB. 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 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; VAL [\old(counter)=5, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s, c, k, xy, yy; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [\old(counter)=0, counter=0, x=1, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [\old(counter)=0, counter=0, x=1, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 [L33] c = 0 [L34] k = 0 [L35] xy = (long long) x * y [L36] yy = (long long) y * y VAL [\old(counter)=0, a=1, b=2, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L37] CALL assume_abort_if_not(xy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L37] RET assume_abort_if_not(xy < 2147483647) VAL [\old(counter)=0, a=1, b=2, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L38] CALL assume_abort_if_not(yy < 2147483647) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L38] RET assume_abort_if_not(yy < 2147483647) VAL [\old(counter)=0, a=1, b=2, c=0, counter=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L40] EXPR counter++ VAL [\old(counter)=0, a=1, b=2, c=0, counter=1, counter++=0, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L40] COND TRUE counter++<2 [L41] COND FALSE !(!(b != 0)) [L43] c = a [L44] k = 0 VAL [\old(counter)=0, a=1, b=2, c=1, counter=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L46] EXPR counter++ VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L46] COND TRUE counter++<2 [L47] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L47] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L48] CALL __VERIFIER_assert(a == y*r + x*p) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L48] RET __VERIFIER_assert(a == y*r + x*p) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L49] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L49] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L50] CALL __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L50] RET __VERIFIER_assert(q*xy + s*yy - q*x - b*y - s*y + b == 0) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L51] COND TRUE !(c >= b) VAL [\old(counter)=0, a=1, b=2, c=1, counter=2, k=0, p=1, q=0, r=0, s=1, x=1, xy=2, y=2, yy=4] [L57] a = b [L58] b = c [L60] long long temp; [L61] temp = p [L62] p = q [L63] q = temp - q * k [L64] temp = r [L65] r = s [L66] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=2, y=2, yy=4] [L40] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=1, xy=2, y=2, yy=4] [L40] COND FALSE !(counter++<2) [L70] CALL __VERIFIER_assert(q*x + s*y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=3] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=3] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 39 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 52.7s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 112 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 1031 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 697 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 435 IncrementalHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 334 mSDtfsCounter, 435 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 474 GetRequests, 419 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=8, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 11 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 46.2s InterpolantComputationTime, 372 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 457 ConstructedInterpolants, 0 QuantifiedInterpolants, 1324 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1121 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 287/328 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 RESULT: Ultimate proved your program to be incorrect! [2022-04-07 19:07:29,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...