/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/egcd3-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-07 19:19:56,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-07 19:19:56,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-07 19:19:56,332 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-07 19:19:56,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-07 19:19:56,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-07 19:19:56,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-07 19:19:56,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-07 19:19:56,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-07 19:19:56,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-07 19:19:56,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-07 19:19:56,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-07 19:19:56,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-07 19:19:56,351 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-07 19:19:56,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-07 19:19:56,354 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-07 19:19:56,355 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-07 19:19:56,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-07 19:19:56,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-07 19:19:56,362 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-07 19:19:56,364 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-07 19:19:56,365 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-07 19:19:56,366 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-07 19:19:56,367 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-07 19:19:56,368 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-07 19:19:56,374 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-07 19:19:56,375 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-07 19:19:56,375 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-07 19:19:56,376 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-07 19:19:56,376 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-07 19:19:56,377 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-07 19:19:56,378 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-07 19:19:56,379 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-07 19:19:56,380 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-07 19:19:56,380 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-07 19:19:56,381 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-07 19:19:56,381 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-07 19:19:56,382 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-07 19:19:56,382 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-07 19:19:56,382 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-07 19:19:56,383 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-07 19:19:56,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-07 19:19:56,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-07 19:19:56,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-07 19:19:56,395 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-07 19:19:56,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-07 19:19:56,396 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-07 19:19:56,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-07 19:19:56,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-07 19:19:56,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-07 19:19:56,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-07 19:19:56,397 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-07 19:19:56,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-07 19:19:56,398 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-07 19:19:56,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-07 19:19:56,398 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-07 19:19:56,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-07 19:19:56,399 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-07 19:19:56,399 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-07 19:19:56,399 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-07 19:19:56,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-07 19:19:56,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:19:56,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-07 19:19:56,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-07 19:19:56,401 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-07 19:19:56,401 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:19:56,626 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-07 19:19:56,646 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-07 19:19:56,648 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-07 19:19:56,648 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-07 19:19:56,649 INFO L275 PluginConnector]: CDTParser initialized [2022-04-07 19:19:56,650 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2022-04-07 19:19:56,699 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c38f5e4/a88dacf8924f4ef3976f2caec4517e0d/FLAG6ffbfa384 [2022-04-07 19:19:57,076 INFO L306 CDTParser]: Found 1 translation units. [2022-04-07 19:19:57,076 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd3-ll_unwindbound5.c [2022-04-07 19:19:57,088 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c38f5e4/a88dacf8924f4ef3976f2caec4517e0d/FLAG6ffbfa384 [2022-04-07 19:19:57,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65c38f5e4/a88dacf8924f4ef3976f2caec4517e0d [2022-04-07 19:19:57,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-07 19:19:57,107 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-07 19:19:57,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-07 19:19:57,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-07 19:19:57,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-07 19:19:57,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,115 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14d231 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57, skipping insertion in model container [2022-04-07 19:19:57,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,120 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-07 19:19:57,135 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-07 19:19:57,302 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/egcd3-ll_unwindbound5.c[490,503] [2022-04-07 19:19:57,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:19:57,346 INFO L203 MainTranslator]: Completed pre-run [2022-04-07 19:19:57,361 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/egcd3-ll_unwindbound5.c[490,503] [2022-04-07 19:19:57,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-07 19:19:57,395 INFO L208 MainTranslator]: Completed translation [2022-04-07 19:19:57,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57 WrapperNode [2022-04-07 19:19:57,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-07 19:19:57,396 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-07 19:19:57,396 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-07 19:19:57,396 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-07 19:19:57,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,426 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,430 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,431 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-07 19:19:57,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-07 19:19:57,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-07 19:19:57,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-07 19:19:57,439 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-07 19:19:57,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:19:57,464 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:19:57,472 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:19:57,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-07 19:19:57,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-07 19:19:57,501 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-07 19:19:57,501 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-07 19:19:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-07 19:19:57,502 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-07 19:19:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-07 19:19:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-07 19:19:57,502 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-07 19:19:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-07 19:19:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-07 19:19:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-07 19:19:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-07 19:19:57,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-07 19:19:57,504 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-07 19:19:57,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-07 19:19:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-07 19:19:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-07 19:19:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-07 19:19:57,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-07 19:19:57,570 INFO L234 CfgBuilder]: Building ICFG [2022-04-07 19:19:57,572 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-07 19:19:57,858 INFO L275 CfgBuilder]: Performing block encoding [2022-04-07 19:19:57,863 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-07 19:19:57,864 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-07 19:19:57,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:19:57 BoogieIcfgContainer [2022-04-07 19:19:57,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-07 19:19:57,866 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-07 19:19:57,866 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-07 19:19:57,870 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-07 19:19:57,872 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:19:57" (1/1) ... [2022-04-07 19:19:57,874 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-07 19:19:57,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:19:57 BasicIcfg [2022-04-07 19:19:57,922 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-07 19:19:57,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-07 19:19:57,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-07 19:19:57,926 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-07 19:19:57,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.04 07:19:57" (1/4) ... [2022-04-07 19:19:57,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d97e34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:19:57, skipping insertion in model container [2022-04-07 19:19:57,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.04 07:19:57" (2/4) ... [2022-04-07 19:19:57,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d97e34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.04 07:19:57, skipping insertion in model container [2022-04-07 19:19:57,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.04 07:19:57" (3/4) ... [2022-04-07 19:19:57,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d97e34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:19:57, skipping insertion in model container [2022-04-07 19:19:57,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 07.04 07:19:57" (4/4) ... [2022-04-07 19:19:57,932 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd3-ll_unwindbound5.cJordan [2022-04-07 19:19:57,938 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-07 19:19:57,938 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-07 19:19:57,985 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-07 19:19:58,000 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:19:58,001 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-07 19:19:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-07 19:19:58,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-07 19:19:58,022 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:19:58,023 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:19:58,023 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:19:58,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:19:58,028 INFO L85 PathProgramCache]: Analyzing trace with hash 6304412, now seen corresponding path program 1 times [2022-04-07 19:19:58,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:19:58,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629078310] [2022-04-07 19:19:58,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:19:58,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:58,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-07 19:19:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:58,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {43#true} is VALID [2022-04-07 19:19:58,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:19:58,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:19:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-07 19:19:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:58,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] 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] {43#true} is VALID [2022-04-07 19:19:58,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {44#false} is VALID [2022-04-07 19:19:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-07 19:19:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:58,244 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [119] 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] {43#true} is VALID [2022-04-07 19:19:58,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,246 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {44#false} is VALID [2022-04-07 19:19:58,248 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-07 19:19:58,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {43#true} is VALID [2022-04-07 19:19:58,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:19:58,249 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:19:58,249 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-07 19:19:58,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {43#true} is VALID [2022-04-07 19:19:58,250 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {43#true} is VALID [2022-04-07 19:19:58,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} [119] 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] {43#true} is VALID [2022-04-07 19:19:58,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,252 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {44#false} is VALID [2022-04-07 19:19:58,252 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {43#true} is VALID [2022-04-07 19:19:58,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} [119] 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] {43#true} is VALID [2022-04-07 19:19:58,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} [121] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,254 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {44#false} is VALID [2022-04-07 19:19:58,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {44#false} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID [2022-04-07 19:19:58,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {44#false} [123] L34-3-->L34-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,254 INFO L272 TraceCheckUtils]: 18: Hoare triple {44#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {44#false} is VALID [2022-04-07 19:19:58,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} [130] __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] {44#false} is VALID [2022-04-07 19:19:58,255 INFO L290 TraceCheckUtils]: 20: Hoare triple {44#false} [134] 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[] {44#false} is VALID [2022-04-07 19:19:58,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {44#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-07 19:19:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:19:58,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:19:58,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629078310] [2022-04-07 19:19:58,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629078310] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:19:58,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:19:58,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-07 19:19:58,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098744339] [2022-04-07 19:19:58,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:19:58,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 19:19:58,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:19:58,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:58,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:58,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-07 19:19:58,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:19:58,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-07 19:19:58,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:19:58,323 INFO L87 Difference]: Start difference. First operand has 40 states, 25 states have (on average 1.48) internal successors, (37), 26 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:58,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:58,492 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2022-04-07 19:19:58,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-07 19:19:58,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-07 19:19:58,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:19:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:58,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-04-07 19:19:58,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2022-04-07 19:19:58,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2022-04-07 19:19:58,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:58,608 INFO L225 Difference]: With dead ends: 41 [2022-04-07 19:19:58,608 INFO L226 Difference]: Without dead ends: 36 [2022-04-07 19:19:58,609 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-07 19:19:58,612 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:19:58,612 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 51 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:19:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-07 19:19:58,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-07 19:19:58,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:19:58,636 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:58,636 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:58,637 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:58,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:58,642 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-07 19:19:58,642 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-07 19:19:58,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:58,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:58,643 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-07 19:19:58,644 INFO L87 Difference]: Start difference. First operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 36 states. [2022-04-07 19:19:58,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:58,647 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-04-07 19:19:58,648 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2022-04-07 19:19:58,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:58,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:58,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:19:58,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:19:58,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:58,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-04-07 19:19:58,653 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 22 [2022-04-07 19:19:58,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:19:58,653 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-04-07 19:19:58,653 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:58,653 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-04-07 19:19:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-07 19:19:58,654 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:19:58,654 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:19:58,654 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-07 19:19:58,655 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:19:58,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:19:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash 1535904754, now seen corresponding path program 1 times [2022-04-07 19:19:58,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:19:58,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431617724] [2022-04-07 19:19:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:19:58,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:19:58,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [956287826] [2022-04-07 19:19:58,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:58,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:19:58,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:19:58,675 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:19:58,686 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:19:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:58,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 19:19:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:58,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:19:58,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {207#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {207#true} is VALID [2022-04-07 19:19:58,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {207#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {215#(<= ~counter~0 0)} {207#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,897 INFO L272 TraceCheckUtils]: 4: Hoare triple {215#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {215#(<= ~counter~0 0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {215#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {215#(<= ~counter~0 0)} [119] 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] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {215#(<= ~counter~0 0)} [122] 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[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {215#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,900 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {215#(<= ~counter~0 0)} {215#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,901 INFO L272 TraceCheckUtils]: 11: Hoare triple {215#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,901 INFO L290 TraceCheckUtils]: 12: Hoare triple {215#(<= ~counter~0 0)} [119] 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] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {215#(<= ~counter~0 0)} [122] 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[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {215#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,903 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {215#(<= ~counter~0 0)} {215#(<= ~counter~0 0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,903 INFO L290 TraceCheckUtils]: 16: Hoare triple {215#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {215#(<= ~counter~0 0)} is VALID [2022-04-07 19:19:58,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {215#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {264#(<= |main_#t~post6| 0)} is VALID [2022-04-07 19:19:58,904 INFO L290 TraceCheckUtils]: 18: Hoare triple {264#(<= |main_#t~post6| 0)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {208#false} is VALID [2022-04-07 19:19:58,905 INFO L272 TraceCheckUtils]: 19: Hoare triple {208#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {208#false} is VALID [2022-04-07 19:19:58,905 INFO L290 TraceCheckUtils]: 20: Hoare triple {208#false} [130] __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] {208#false} is VALID [2022-04-07 19:19:58,905 INFO L290 TraceCheckUtils]: 21: Hoare triple {208#false} [134] 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[] {208#false} is VALID [2022-04-07 19:19:58,905 INFO L290 TraceCheckUtils]: 22: Hoare triple {208#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {208#false} is VALID [2022-04-07 19:19:58,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:19:58,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:19:58,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:19:58,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431617724] [2022-04-07 19:19:58,906 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:19:58,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [956287826] [2022-04-07 19:19:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [956287826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:19:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:19:58,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-07 19:19:58,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192057611] [2022-04-07 19:19:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:19:58,908 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 19:19:58,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:19:58,909 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:58,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:58,926 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-07 19:19:58,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:19:58,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-07 19:19:58,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-07 19:19:58,927 INFO L87 Difference]: Start difference. First operand 35 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:58,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:58,999 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-07 19:19:58,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-07 19:19:58,999 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-07 19:19:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:19:59,000 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:59,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-07 19:19:59,002 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:59,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 48 transitions. [2022-04-07 19:19:59,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 48 transitions. [2022-04-07 19:19:59,043 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:19:59,044 INFO L225 Difference]: With dead ends: 37 [2022-04-07 19:19:59,044 INFO L226 Difference]: Without dead ends: 37 [2022-04-07 19:19:59,045 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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:19:59,046 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:19:59,046 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:19:59,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-07 19:19:59,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-07 19:19:59,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:19:59,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:59,051 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:59,051 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:59,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:59,054 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-07 19:19:59,054 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-07 19:19:59,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:59,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:59,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-07 19:19:59,055 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 37 states. [2022-04-07 19:19:59,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:59,058 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2022-04-07 19:19:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-07 19:19:59,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:59,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:59,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:19:59,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:19:59,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:59,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2022-04-07 19:19:59,061 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 23 [2022-04-07 19:19:59,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:19:59,061 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2022-04-07 19:19:59,062 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:19:59,062 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2022-04-07 19:19:59,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-07 19:19:59,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:19:59,063 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:19:59,090 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:19:59,279 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:19:59,280 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:19:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:19:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash 401530880, now seen corresponding path program 1 times [2022-04-07 19:19:59,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:19:59,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942177988] [2022-04-07 19:19:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:19:59,309 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:19:59,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1638238056] [2022-04-07 19:19:59,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:19:59,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:19:59,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:19:59,311 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:19:59,314 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:19:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:59,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:19:59,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:19:59,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:19:59,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {427#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:19:59,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {427#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {427#true} is VALID [2022-04-07 19:19:59,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {427#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:19:59,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {427#true} {427#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:19:59,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {427#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:19:59,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {427#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {427#true} is VALID [2022-04-07 19:19:59,493 INFO L272 TraceCheckUtils]: 6: Hoare triple {427#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {427#true} is VALID [2022-04-07 19:19:59,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {427#true} [119] 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] {427#true} is VALID [2022-04-07 19:19:59,494 INFO L290 TraceCheckUtils]: 8: Hoare triple {427#true} [122] 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[] {427#true} is VALID [2022-04-07 19:19:59,494 INFO L290 TraceCheckUtils]: 9: Hoare triple {427#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {427#true} is VALID [2022-04-07 19:19:59,494 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {427#true} {427#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {427#true} is VALID [2022-04-07 19:19:59,495 INFO L272 TraceCheckUtils]: 11: Hoare triple {427#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {427#true} is VALID [2022-04-07 19:19:59,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {427#true} [119] 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] {468#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:19:59,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {468#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {472#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:19:59,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {472#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {472#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:19:59,497 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {472#(not (= |assume_abort_if_not_#in~cond| 0))} {427#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {479#(<= 1 main_~y~0)} is VALID [2022-04-07 19:19:59,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {479#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {483#(<= 1 main_~b~0)} is VALID [2022-04-07 19:19:59,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {483#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {483#(<= 1 main_~b~0)} is VALID [2022-04-07 19:19:59,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {483#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {483#(<= 1 main_~b~0)} is VALID [2022-04-07 19:19:59,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {483#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-07 19:19:59,499 INFO L272 TraceCheckUtils]: 20: Hoare triple {428#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {428#false} is VALID [2022-04-07 19:19:59,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {428#false} [130] __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] {428#false} is VALID [2022-04-07 19:19:59,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {428#false} [134] 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[] {428#false} is VALID [2022-04-07 19:19:59,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {428#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {428#false} is VALID [2022-04-07 19:19:59,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:19:59,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:19:59,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:19:59,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942177988] [2022-04-07 19:19:59,500 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:19:59,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1638238056] [2022-04-07 19:19:59,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1638238056] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:19:59,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:19:59,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:19:59,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465817647] [2022-04-07 19:19:59,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:19:59,502 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-07 19:19:59,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:19:59,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:19:59,520 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:19:59,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:19:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:19:59,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:19:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:19:59,521 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:19:59,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:59,746 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-07 19:19:59,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:19:59,746 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2022-04-07 19:19:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:19:59,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:19:59,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-07 19:19:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:19:59,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2022-04-07 19:19:59,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2022-04-07 19:19:59,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:19:59,823 INFO L225 Difference]: With dead ends: 50 [2022-04-07 19:19:59,823 INFO L226 Difference]: Without dead ends: 50 [2022-04-07 19:19:59,824 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-07 19:19:59,826 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 46 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:19:59,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 148 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:19:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-07 19:19:59,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 38. [2022-04-07 19:19:59,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:19:59,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:59,836 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:59,837 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:59,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:59,847 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-07 19:19:59,847 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-07 19:19:59,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:59,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:59,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-07 19:19:59,850 INFO L87 Difference]: Start difference. First operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 50 states. [2022-04-07 19:19:59,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:19:59,853 INFO L93 Difference]: Finished difference Result 50 states and 68 transitions. [2022-04-07 19:19:59,853 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 68 transitions. [2022-04-07 19:19:59,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:19:59,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:19:59,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:19:59,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:19:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:19:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-04-07 19:19:59,856 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 24 [2022-04-07 19:19:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:19:59,856 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-04-07 19:19:59,856 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:19:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-04-07 19:19:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 19:19:59,857 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:19:59,857 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:19:59,883 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:00,058 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,SelfDestructingSolverStorable2 [2022-04-07 19:20:00,058 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:00,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:00,059 INFO L85 PathProgramCache]: Analyzing trace with hash 2110136122, now seen corresponding path program 1 times [2022-04-07 19:20:00,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:00,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362580573] [2022-04-07 19:20:00,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:00,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:00,082 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:00,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1696568879] [2022-04-07 19:20:00,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:00,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:00,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:00,087 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:20:00,091 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:20:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:00,134 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:20:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:00,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:00,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {696#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-07 19:20:00,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {696#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {704#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {704#(<= ~counter~0 0)} {696#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,340 INFO L272 TraceCheckUtils]: 4: Hoare triple {704#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {704#(<= ~counter~0 0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,343 INFO L272 TraceCheckUtils]: 6: Hoare triple {704#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,343 INFO L290 TraceCheckUtils]: 7: Hoare triple {704#(<= ~counter~0 0)} [119] 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] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {704#(<= ~counter~0 0)} [122] 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[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {704#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,346 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {704#(<= ~counter~0 0)} {704#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,347 INFO L272 TraceCheckUtils]: 11: Hoare triple {704#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,348 INFO L290 TraceCheckUtils]: 12: Hoare triple {704#(<= ~counter~0 0)} [119] 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] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,348 INFO L290 TraceCheckUtils]: 13: Hoare triple {704#(<= ~counter~0 0)} [122] 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[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,348 INFO L290 TraceCheckUtils]: 14: Hoare triple {704#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,349 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {704#(<= ~counter~0 0)} {704#(<= ~counter~0 0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {704#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:00,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {704#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {753#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:00,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {753#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {753#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:00,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {753#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {753#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:00,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {753#(<= ~counter~0 1)} [137] L41-3-->L41-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] {763#(<= |main_#t~post7| 1)} is VALID [2022-04-07 19:20:00,353 INFO L290 TraceCheckUtils]: 21: Hoare triple {763#(<= |main_#t~post7| 1)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {697#false} is VALID [2022-04-07 19:20:00,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {697#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {697#false} is VALID [2022-04-07 19:20:00,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {697#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {697#false} is VALID [2022-04-07 19:20:00,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {697#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {697#false} is VALID [2022-04-07 19:20:00,354 INFO L272 TraceCheckUtils]: 25: Hoare triple {697#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {697#false} is VALID [2022-04-07 19:20:00,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {697#false} [130] __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] {697#false} is VALID [2022-04-07 19:20:00,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {697#false} [134] 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[] {697#false} is VALID [2022-04-07 19:20:00,354 INFO L290 TraceCheckUtils]: 28: Hoare triple {697#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {697#false} is VALID [2022-04-07 19:20:00,355 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:20:00,355 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:20:00,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:00,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362580573] [2022-04-07 19:20:00,355 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:00,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1696568879] [2022-04-07 19:20:00,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1696568879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:20:00,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:20:00,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:20:00,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920935985] [2022-04-07 19:20:00,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:20:00,357 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-07 19:20:00,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:00,357 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:00,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:00,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:20:00,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:00,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:20:00,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:20:00,382 INFO L87 Difference]: Start difference. First operand 38 states and 48 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:00,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:00,500 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-07 19:20:00,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:20:00,500 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-07 19:20:00,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:00,501 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:00,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 19:20:00,502 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:00,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-04-07 19:20:00,504 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-04-07 19:20:00,546 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:20:00,547 INFO L225 Difference]: With dead ends: 40 [2022-04-07 19:20:00,548 INFO L226 Difference]: Without dead ends: 40 [2022-04-07 19:20:00,548 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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:20:00,549 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 6 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:00,549 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 139 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:20:00,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-07 19:20:00,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-07 19:20:00,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:00,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:20:00,553 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:20:00,553 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:20:00,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:00,555 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-07 19:20:00,555 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-07 19:20:00,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:00,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:00,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-07 19:20:00,556 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 40 states. [2022-04-07 19:20:00,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:00,558 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-04-07 19:20:00,558 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-07 19:20:00,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:00,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:00,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:00,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 28 states have internal predecessors, (34), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-07 19:20:00,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-04-07 19:20:00,561 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 29 [2022-04-07 19:20:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:00,561 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-04-07 19:20:00,562 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:00,562 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-04-07 19:20:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-07 19:20:00,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:00,562 INFO L499 BasicCegarLoop]: trace histogram [2, 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] [2022-04-07 19:20:00,580 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:20:00,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:00,767 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:00,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:00,768 INFO L85 PathProgramCache]: Analyzing trace with hash -358604865, now seen corresponding path program 1 times [2022-04-07 19:20:00,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:00,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710828175] [2022-04-07 19:20:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:00,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:00,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:00,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1578122866] [2022-04-07 19:20:00,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:00,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:00,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:00,795 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:20:00,809 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:20:00,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:00,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 19:20:00,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:00,878 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:01,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {947#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:20:01,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {947#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {947#true} is VALID [2022-04-07 19:20:01,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {947#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:20:01,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {947#true} {947#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:20:01,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {947#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:20:01,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {947#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {947#true} is VALID [2022-04-07 19:20:01,240 INFO L272 TraceCheckUtils]: 6: Hoare triple {947#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {947#true} is VALID [2022-04-07 19:20:01,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {947#true} [119] 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] {947#true} is VALID [2022-04-07 19:20:01,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {947#true} [122] 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[] {947#true} is VALID [2022-04-07 19:20:01,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {947#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {947#true} is VALID [2022-04-07 19:20:01,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {947#true} {947#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {947#true} is VALID [2022-04-07 19:20:01,241 INFO L272 TraceCheckUtils]: 11: Hoare triple {947#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {947#true} is VALID [2022-04-07 19:20:01,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {947#true} [119] 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] {988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:20:01,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {988#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:01,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {992#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {992#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:01,247 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {992#(not (= |assume_abort_if_not_#in~cond| 0))} {947#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {999#(<= 1 main_~y~0)} is VALID [2022-04-07 19:20:01,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {999#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:01,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:01,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:01,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {1003#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:01,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-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] {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:01,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:01,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {1013#(and (= main_~r~0 0) (<= main_~y~0 main_~b~0) (<= main_~c~0 main_~a~0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:01,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:01,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:01,254 INFO L272 TraceCheckUtils]: 25: Hoare triple {1023#(and (= main_~r~0 0) (<= 1 main_~y~0) (<= main_~y~0 main_~a~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:01,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {1033#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {1037#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:01,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {1037#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {948#false} is VALID [2022-04-07 19:20:01,255 INFO L290 TraceCheckUtils]: 28: Hoare triple {948#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {948#false} is VALID [2022-04-07 19:20:01,256 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:20:01,256 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:20:01,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:01,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710828175] [2022-04-07 19:20:01,256 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:01,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578122866] [2022-04-07 19:20:01,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578122866] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:20:01,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:20:01,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-07 19:20:01,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105575910] [2022-04-07 19:20:01,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:20:01,257 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-07 19:20:01,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:01,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:01,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:01,279 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 19:20:01,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:01,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 19:20:01,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:20:01,279 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:01,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:01,913 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-07 19:20:01,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 19:20:01,913 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 29 [2022-04-07 19:20:01,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:01,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-04-07 19:20:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 91 transitions. [2022-04-07 19:20:01,929 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 91 transitions. [2022-04-07 19:20:02,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:02,024 INFO L225 Difference]: With dead ends: 66 [2022-04-07 19:20:02,024 INFO L226 Difference]: Without dead ends: 66 [2022-04-07 19:20:02,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-07 19:20:02,025 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 67 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:02,025 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 227 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:20:02,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-07 19:20:02,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 55. [2022-04-07 19:20:02,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:02,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:20:02,030 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:20:02,030 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:20:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:02,032 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-07 19:20:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-07 19:20:02,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:02,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:02,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-07 19:20:02,034 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 66 states. [2022-04-07 19:20:02,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:02,036 INFO L93 Difference]: Finished difference Result 66 states and 90 transitions. [2022-04-07 19:20:02,036 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 90 transitions. [2022-04-07 19:20:02,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:02,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:02,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:02,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 38 states have internal predecessors, (48), 13 states have call successors, (13), 5 states have call predecessors, (13), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-07 19:20:02,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2022-04-07 19:20:02,039 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 29 [2022-04-07 19:20:02,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:02,040 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2022-04-07 19:20:02,040 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:02,040 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2022-04-07 19:20:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-07 19:20:02,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:02,040 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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:20:02,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:02,263 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:02,263 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:02,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:02,264 INFO L85 PathProgramCache]: Analyzing trace with hash -2061673945, now seen corresponding path program 1 times [2022-04-07 19:20:02,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:02,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757121477] [2022-04-07 19:20:02,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:02,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:02,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:02,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1857797622] [2022-04-07 19:20:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:02,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:02,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:02,304 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:20:02,311 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:20:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:02,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 19:20:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:02,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:02,529 INFO L272 TraceCheckUtils]: 0: Hoare triple {1304#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:20:02,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {1304#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {1312#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,531 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1312#(<= ~counter~0 0)} {1304#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {1312#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {1312#(<= ~counter~0 0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,533 INFO L272 TraceCheckUtils]: 6: Hoare triple {1312#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {1312#(<= ~counter~0 0)} [119] 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] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {1312#(<= ~counter~0 0)} [122] 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[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,534 INFO L290 TraceCheckUtils]: 9: Hoare triple {1312#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,534 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1312#(<= ~counter~0 0)} {1312#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,535 INFO L272 TraceCheckUtils]: 11: Hoare triple {1312#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {1312#(<= ~counter~0 0)} [119] 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] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {1312#(<= ~counter~0 0)} [122] 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[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,536 INFO L290 TraceCheckUtils]: 14: Hoare triple {1312#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,536 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1312#(<= ~counter~0 0)} {1312#(<= ~counter~0 0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {1312#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1312#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:02,537 INFO L290 TraceCheckUtils]: 17: Hoare triple {1312#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1361#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:02,537 INFO L290 TraceCheckUtils]: 18: Hoare triple {1361#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1361#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:02,538 INFO L290 TraceCheckUtils]: 19: Hoare triple {1361#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1361#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:02,538 INFO L290 TraceCheckUtils]: 20: Hoare triple {1361#(<= ~counter~0 1)} [137] L41-3-->L41-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] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {1371#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {1371#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {1371#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,541 INFO L290 TraceCheckUtils]: 24: Hoare triple {1371#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1384#(<= |main_#t~post6| 2)} is VALID [2022-04-07 19:20:02,541 INFO L290 TraceCheckUtils]: 25: Hoare triple {1384#(<= |main_#t~post6| 2)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1305#false} is VALID [2022-04-07 19:20:02,541 INFO L272 TraceCheckUtils]: 26: Hoare triple {1305#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {1305#false} is VALID [2022-04-07 19:20:02,541 INFO L290 TraceCheckUtils]: 27: Hoare triple {1305#false} [130] __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] {1305#false} is VALID [2022-04-07 19:20:02,542 INFO L290 TraceCheckUtils]: 28: Hoare triple {1305#false} [134] 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[] {1305#false} is VALID [2022-04-07 19:20:02,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {1305#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1305#false} is VALID [2022-04-07 19:20:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:20:02,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:20:02,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {1305#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1305#false} is VALID [2022-04-07 19:20:02,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {1305#false} [134] 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[] {1305#false} is VALID [2022-04-07 19:20:02,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {1305#false} [130] __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] {1305#false} is VALID [2022-04-07 19:20:02,725 INFO L272 TraceCheckUtils]: 26: Hoare triple {1305#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {1305#false} is VALID [2022-04-07 19:20:02,726 INFO L290 TraceCheckUtils]: 25: Hoare triple {1412#(< |main_#t~post6| 5)} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1305#false} is VALID [2022-04-07 19:20:02,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {1416#(< ~counter~0 5)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1412#(< |main_#t~post6| 5)} is VALID [2022-04-07 19:20:02,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {1416#(< ~counter~0 5)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1416#(< ~counter~0 5)} is VALID [2022-04-07 19:20:02,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {1416#(< ~counter~0 5)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1416#(< ~counter~0 5)} is VALID [2022-04-07 19:20:02,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {1416#(< ~counter~0 5)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1416#(< ~counter~0 5)} is VALID [2022-04-07 19:20:02,728 INFO L290 TraceCheckUtils]: 20: Hoare triple {1429#(< ~counter~0 4)} [137] L41-3-->L41-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] {1416#(< ~counter~0 5)} is VALID [2022-04-07 19:20:02,728 INFO L290 TraceCheckUtils]: 19: Hoare triple {1429#(< ~counter~0 4)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1429#(< ~counter~0 4)} is VALID [2022-04-07 19:20:02,730 INFO L290 TraceCheckUtils]: 18: Hoare triple {1429#(< ~counter~0 4)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1429#(< ~counter~0 4)} is VALID [2022-04-07 19:20:02,730 INFO L290 TraceCheckUtils]: 17: Hoare triple {1371#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1429#(< ~counter~0 4)} is VALID [2022-04-07 19:20:02,731 INFO L290 TraceCheckUtils]: 16: Hoare triple {1371#(<= ~counter~0 2)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,734 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1304#true} {1371#(<= ~counter~0 2)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,734 INFO L290 TraceCheckUtils]: 14: Hoare triple {1304#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:20:02,734 INFO L290 TraceCheckUtils]: 13: Hoare triple {1304#true} [122] 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[] {1304#true} is VALID [2022-04-07 19:20:02,735 INFO L290 TraceCheckUtils]: 12: Hoare triple {1304#true} [119] 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] {1304#true} is VALID [2022-04-07 19:20:02,735 INFO L272 TraceCheckUtils]: 11: Hoare triple {1371#(<= ~counter~0 2)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1304#true} is VALID [2022-04-07 19:20:02,735 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1304#true} {1371#(<= ~counter~0 2)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {1304#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:20:02,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {1304#true} [122] 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[] {1304#true} is VALID [2022-04-07 19:20:02,736 INFO L290 TraceCheckUtils]: 7: Hoare triple {1304#true} [119] 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] {1304#true} is VALID [2022-04-07 19:20:02,736 INFO L272 TraceCheckUtils]: 6: Hoare triple {1371#(<= ~counter~0 2)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1304#true} is VALID [2022-04-07 19:20:02,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {1371#(<= ~counter~0 2)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {1371#(<= ~counter~0 2)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,737 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1371#(<= ~counter~0 2)} {1304#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {1371#(<= ~counter~0 2)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {1304#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {1371#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:02,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {1304#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1304#true} is VALID [2022-04-07 19:20:02,739 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:20:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:02,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757121477] [2022-04-07 19:20:02,739 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:02,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857797622] [2022-04-07 19:20:02,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857797622] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:20:02,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:20:02,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-04-07 19:20:02,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915821621] [2022-04-07 19:20:02,740 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:20:02,740 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-07 19:20:02,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:02,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:02,775 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:20:02,775 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 19:20:02,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:02,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 19:20:02,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:20:02,776 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:03,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:03,068 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2022-04-07 19:20:03,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 19:20:03,069 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 30 [2022-04-07 19:20:03,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:03,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:03,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2022-04-07 19:20:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:03,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 108 transitions. [2022-04-07 19:20:03,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 108 transitions. [2022-04-07 19:20:03,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:03,163 INFO L225 Difference]: With dead ends: 109 [2022-04-07 19:20:03,163 INFO L226 Difference]: Without dead ends: 109 [2022-04-07 19:20:03,163 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:20:03,164 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 77 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:03,164 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 210 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:20:03,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-07 19:20:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 100. [2022-04-07 19:20:03,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:03,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 19:20:03,172 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 19:20:03,172 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 19:20:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:03,176 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2022-04-07 19:20:03,176 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2022-04-07 19:20:03,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:03,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:03,177 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 109 states. [2022-04-07 19:20:03,178 INFO L87 Difference]: Start difference. First operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 109 states. [2022-04-07 19:20:03,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:03,182 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2022-04-07 19:20:03,182 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 140 transitions. [2022-04-07 19:20:03,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:03,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:03,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:03,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:03,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 69 states have (on average 1.318840579710145) internal successors, (91), 72 states have internal predecessors, (91), 22 states have call successors, (22), 9 states have call predecessors, (22), 8 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-07 19:20:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 132 transitions. [2022-04-07 19:20:03,187 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 132 transitions. Word has length 30 [2022-04-07 19:20:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:03,187 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 132 transitions. [2022-04-07 19:20:03,187 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.888888888888889) internal successors, (35), 9 states have internal predecessors, (35), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 132 transitions. [2022-04-07 19:20:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-07 19:20:03,188 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:03,188 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:20:03,213 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:20:03,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:03,403 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:03,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:03,404 INFO L85 PathProgramCache]: Analyzing trace with hash 545740907, now seen corresponding path program 1 times [2022-04-07 19:20:03,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:03,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425625534] [2022-04-07 19:20:03,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:03,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:03,423 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:03,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781159681] [2022-04-07 19:20:03,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:03,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:03,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:03,424 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:20:03,431 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:20:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:03,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 19:20:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:03,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:03,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {1923#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {1923#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {1923#true} is VALID [2022-04-07 19:20:03,633 INFO L290 TraceCheckUtils]: 2: Hoare triple {1923#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,633 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1923#true} {1923#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,633 INFO L272 TraceCheckUtils]: 4: Hoare triple {1923#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {1923#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1923#true} is VALID [2022-04-07 19:20:03,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {1923#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1923#true} is VALID [2022-04-07 19:20:03,637 INFO L290 TraceCheckUtils]: 7: Hoare triple {1923#true} [119] 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] {1949#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:20:03,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {1949#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {1953#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:03,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {1953#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:03,638 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1953#(not (= |assume_abort_if_not_#in~cond| 0))} {1923#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1960#(<= 1 main_~x~0)} is VALID [2022-04-07 19:20:03,638 INFO L272 TraceCheckUtils]: 11: Hoare triple {1960#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1923#true} is VALID [2022-04-07 19:20:03,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {1923#true} [119] 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] {1923#true} is VALID [2022-04-07 19:20:03,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {1923#true} [122] 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[] {1923#true} is VALID [2022-04-07 19:20:03,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {1923#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,640 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1923#true} {1960#(<= 1 main_~x~0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1960#(<= 1 main_~x~0)} is VALID [2022-04-07 19:20:03,641 INFO L290 TraceCheckUtils]: 16: Hoare triple {1960#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1979#(<= 1 main_~a~0)} is VALID [2022-04-07 19:20:03,641 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#(<= 1 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1979#(<= 1 main_~a~0)} is VALID [2022-04-07 19:20:03,641 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#(<= 1 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1979#(<= 1 main_~a~0)} is VALID [2022-04-07 19:20:03,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {1979#(<= 1 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1989#(<= 1 main_~c~0)} is VALID [2022-04-07 19:20:03,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {1989#(<= 1 main_~c~0)} [137] L41-3-->L41-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] {1989#(<= 1 main_~c~0)} is VALID [2022-04-07 19:20:03,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {1989#(<= 1 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1989#(<= 1 main_~c~0)} is VALID [2022-04-07 19:20:03,643 INFO L290 TraceCheckUtils]: 22: Hoare triple {1989#(<= 1 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1989#(<= 1 main_~c~0)} is VALID [2022-04-07 19:20:03,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {1989#(<= 1 main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2002#(<= 1 main_~b~0)} is VALID [2022-04-07 19:20:03,644 INFO L290 TraceCheckUtils]: 24: Hoare triple {2002#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2002#(<= 1 main_~b~0)} is VALID [2022-04-07 19:20:03,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {2002#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2002#(<= 1 main_~b~0)} is VALID [2022-04-07 19:20:03,644 INFO L290 TraceCheckUtils]: 26: Hoare triple {2002#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {1924#false} is VALID [2022-04-07 19:20:03,645 INFO L272 TraceCheckUtils]: 27: Hoare triple {1924#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {1924#false} is VALID [2022-04-07 19:20:03,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {1924#false} [130] __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] {1924#false} is VALID [2022-04-07 19:20:03,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {1924#false} [134] 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[] {1924#false} is VALID [2022-04-07 19:20:03,645 INFO L290 TraceCheckUtils]: 30: Hoare triple {1924#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1924#false} is VALID [2022-04-07 19:20:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:20:03,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:20:03,859 INFO L290 TraceCheckUtils]: 30: Hoare triple {1924#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1924#false} is VALID [2022-04-07 19:20:03,859 INFO L290 TraceCheckUtils]: 29: Hoare triple {1924#false} [134] 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[] {1924#false} is VALID [2022-04-07 19:20:03,859 INFO L290 TraceCheckUtils]: 28: Hoare triple {1924#false} [130] __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] {1924#false} is VALID [2022-04-07 19:20:03,859 INFO L272 TraceCheckUtils]: 27: Hoare triple {1924#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {1924#false} is VALID [2022-04-07 19:20:03,860 INFO L290 TraceCheckUtils]: 26: Hoare triple {2002#(<= 1 main_~b~0)} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {1924#false} is VALID [2022-04-07 19:20:03,860 INFO L290 TraceCheckUtils]: 25: Hoare triple {2002#(<= 1 main_~b~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2002#(<= 1 main_~b~0)} is VALID [2022-04-07 19:20:03,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {2002#(<= 1 main_~b~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2002#(<= 1 main_~b~0)} is VALID [2022-04-07 19:20:03,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {1989#(<= 1 main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2002#(<= 1 main_~b~0)} is VALID [2022-04-07 19:20:03,861 INFO L290 TraceCheckUtils]: 22: Hoare triple {1989#(<= 1 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {1989#(<= 1 main_~c~0)} is VALID [2022-04-07 19:20:03,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {1989#(<= 1 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {1989#(<= 1 main_~c~0)} is VALID [2022-04-07 19:20:03,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {1989#(<= 1 main_~c~0)} [137] L41-3-->L41-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] {1989#(<= 1 main_~c~0)} is VALID [2022-04-07 19:20:03,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {1979#(<= 1 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {1989#(<= 1 main_~c~0)} is VALID [2022-04-07 19:20:03,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {1979#(<= 1 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {1979#(<= 1 main_~a~0)} is VALID [2022-04-07 19:20:03,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {1979#(<= 1 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {1979#(<= 1 main_~a~0)} is VALID [2022-04-07 19:20:03,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {1960#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1979#(<= 1 main_~a~0)} is VALID [2022-04-07 19:20:03,870 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1923#true} {1960#(<= 1 main_~x~0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1960#(<= 1 main_~x~0)} is VALID [2022-04-07 19:20:03,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {1923#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,870 INFO L290 TraceCheckUtils]: 13: Hoare triple {1923#true} [122] 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[] {1923#true} is VALID [2022-04-07 19:20:03,870 INFO L290 TraceCheckUtils]: 12: Hoare triple {1923#true} [119] 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] {1923#true} is VALID [2022-04-07 19:20:03,870 INFO L272 TraceCheckUtils]: 11: Hoare triple {1960#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {1923#true} is VALID [2022-04-07 19:20:03,871 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1953#(not (= |assume_abort_if_not_#in~cond| 0))} {1923#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1960#(<= 1 main_~x~0)} is VALID [2022-04-07 19:20:03,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {1953#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1953#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:03,872 INFO L290 TraceCheckUtils]: 8: Hoare triple {2093#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} [122] 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[] {1953#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:03,872 INFO L290 TraceCheckUtils]: 7: Hoare triple {1923#true} [119] 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] {2093#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-07 19:20:03,872 INFO L272 TraceCheckUtils]: 6: Hoare triple {1923#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {1923#true} is VALID [2022-04-07 19:20:03,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {1923#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1923#true} is VALID [2022-04-07 19:20:03,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {1923#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1923#true} {1923#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {1923#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {1923#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {1923#true} is VALID [2022-04-07 19:20:03,873 INFO L272 TraceCheckUtils]: 0: Hoare triple {1923#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1923#true} is VALID [2022-04-07 19:20:03,873 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:20:03,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:03,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425625534] [2022-04-07 19:20:03,874 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:03,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781159681] [2022-04-07 19:20:03,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781159681] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:20:03,874 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:20:03,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-07 19:20:03,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852108045] [2022-04-07 19:20:03,874 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:20:03,875 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-07 19:20:03,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:03,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:03,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:03,896 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 19:20:03,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:03,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 19:20:03,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:20:03,897 INFO L87 Difference]: Start difference. First operand 100 states and 132 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:04,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:04,549 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2022-04-07 19:20:04,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 19:20:04,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 31 [2022-04-07 19:20:04,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:04,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2022-04-07 19:20:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 149 transitions. [2022-04-07 19:20:04,556 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 149 transitions. [2022-04-07 19:20:04,684 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:04,687 INFO L225 Difference]: With dead ends: 174 [2022-04-07 19:20:04,688 INFO L226 Difference]: Without dead ends: 174 [2022-04-07 19:20:04,688 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2022-04-07 19:20:04,689 INFO L913 BasicCegarLoop]: 65 mSDtfsCounter, 115 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:04,689 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [119 Valid, 306 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:20:04,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-04-07 19:20:04,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 131. [2022-04-07 19:20:04,714 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:04,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:20:04,715 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:20:04,716 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:20:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:04,723 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2022-04-07 19:20:04,723 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 249 transitions. [2022-04-07 19:20:04,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:04,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:04,727 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 174 states. [2022-04-07 19:20:04,727 INFO L87 Difference]: Start difference. First operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 174 states. [2022-04-07 19:20:04,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:04,735 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2022-04-07 19:20:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 249 transitions. [2022-04-07 19:20:04,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:04,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:04,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:04,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:04,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 99 states have internal predecessors, (130), 25 states have call successors, (25), 9 states have call predecessors, (25), 8 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:20:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 178 transitions. [2022-04-07 19:20:04,743 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 178 transitions. Word has length 31 [2022-04-07 19:20:04,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:04,743 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 178 transitions. [2022-04-07 19:20:04,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 8 states have internal predecessors, (25), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:04,743 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 178 transitions. [2022-04-07 19:20:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-07 19:20:04,744 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:04,744 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 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] [2022-04-07 19:20:04,767 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:20:04,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:04,967 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:04,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash 653912885, now seen corresponding path program 1 times [2022-04-07 19:20:04,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:04,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61721155] [2022-04-07 19:20:04,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:04,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:04,987 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:04,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1586278586] [2022-04-07 19:20:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:04,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:04,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:04,989 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:20:05,010 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:20:05,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:05,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-07 19:20:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:05,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:05,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {2784#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2784#true} is VALID [2022-04-07 19:20:05,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {2784#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {2784#true} is VALID [2022-04-07 19:20:05,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {2784#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2784#true} is VALID [2022-04-07 19:20:05,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2784#true} {2784#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2784#true} is VALID [2022-04-07 19:20:05,466 INFO L272 TraceCheckUtils]: 4: Hoare triple {2784#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2784#true} is VALID [2022-04-07 19:20:05,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {2784#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2784#true} is VALID [2022-04-07 19:20:05,466 INFO L272 TraceCheckUtils]: 6: Hoare triple {2784#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {2784#true} is VALID [2022-04-07 19:20:05,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {2784#true} [119] 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] {2784#true} is VALID [2022-04-07 19:20:05,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {2784#true} [122] 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[] {2784#true} is VALID [2022-04-07 19:20:05,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {2784#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2784#true} is VALID [2022-04-07 19:20:05,467 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2784#true} {2784#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {2784#true} is VALID [2022-04-07 19:20:05,467 INFO L272 TraceCheckUtils]: 11: Hoare triple {2784#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {2784#true} is VALID [2022-04-07 19:20:05,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {2784#true} [119] 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] {2825#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:20:05,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {2825#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {2829#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:05,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {2829#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2829#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:05,469 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2829#(not (= |assume_abort_if_not_#in~cond| 0))} {2784#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {2836#(<= 1 main_~y~0)} is VALID [2022-04-07 19:20:05,471 INFO L290 TraceCheckUtils]: 16: Hoare triple {2836#(<= 1 main_~y~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2840#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,471 INFO L290 TraceCheckUtils]: 17: Hoare triple {2840#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {2840#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {2840#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {2840#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {2840#(and (= main_~s~0 1) (<= main_~a~0 main_~x~0) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {2850#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {2850#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [137] L41-3-->L41-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] {2850#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {2850#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {2850#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {2850#(and (<= main_~c~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {2860#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {2860#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {2860#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {2860#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {2860#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,474 INFO L272 TraceCheckUtils]: 25: Hoare triple {2860#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2784#true} is VALID [2022-04-07 19:20:05,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {2784#true} [130] __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] {2784#true} is VALID [2022-04-07 19:20:05,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {2784#true} [135] 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[] {2784#true} is VALID [2022-04-07 19:20:05,475 INFO L290 TraceCheckUtils]: 28: Hoare triple {2784#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2784#true} is VALID [2022-04-07 19:20:05,476 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {2784#true} {2860#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2860#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} is VALID [2022-04-07 19:20:05,477 INFO L272 TraceCheckUtils]: 30: Hoare triple {2860#(and (<= main_~b~0 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (<= 1 main_~y~0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2885#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:05,477 INFO L290 TraceCheckUtils]: 31: Hoare triple {2885#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {2889#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:05,477 INFO L290 TraceCheckUtils]: 32: Hoare triple {2889#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {2785#false} is VALID [2022-04-07 19:20:05,477 INFO L290 TraceCheckUtils]: 33: Hoare triple {2785#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2785#false} is VALID [2022-04-07 19:20:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:20:05,478 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:20:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:05,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61721155] [2022-04-07 19:20:05,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:05,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586278586] [2022-04-07 19:20:05,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586278586] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:20:05,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:20:05,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-07 19:20:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095769861] [2022-04-07 19:20:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:20:05,479 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 19:20:05,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:05,480 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:20:05,507 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:20:05,508 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 19:20:05,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:05,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 19:20:05,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:20:05,509 INFO L87 Difference]: Start difference. First operand 131 states and 178 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:20:06,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:06,103 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2022-04-07 19:20:06,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-07 19:20:06,104 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 34 [2022-04-07 19:20:06,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:06,104 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:20:06,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-07 19:20:06,106 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:20:06,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 92 transitions. [2022-04-07 19:20:06,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 92 transitions. [2022-04-07 19:20:06,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:06,193 INFO L225 Difference]: With dead ends: 154 [2022-04-07 19:20:06,193 INFO L226 Difference]: Without dead ends: 154 [2022-04-07 19:20:06,193 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-04-07 19:20:06,194 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 88 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:06,194 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 228 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:20:06,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-07 19:20:06,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 143. [2022-04-07 19:20:06,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:06,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:20:06,200 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:20:06,200 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:20:06,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:06,205 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2022-04-07 19:20:06,205 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2022-04-07 19:20:06,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:06,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:06,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 154 states. [2022-04-07 19:20:06,207 INFO L87 Difference]: Start difference. First operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) Second operand 154 states. [2022-04-07 19:20:06,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:06,212 INFO L93 Difference]: Finished difference Result 154 states and 204 transitions. [2022-04-07 19:20:06,212 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 204 transitions. [2022-04-07 19:20:06,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:06,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:06,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:06,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:06,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 106 states have (on average 1.3113207547169812) internal successors, (139), 108 states have internal predecessors, (139), 25 states have call successors, (25), 12 states have call predecessors, (25), 11 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-07 19:20:06,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2022-04-07 19:20:06,217 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 34 [2022-04-07 19:20:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:06,218 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2022-04-07 19:20:06,218 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, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-07 19:20:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2022-04-07 19:20:06,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 19:20:06,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:06,219 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:20:06,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:06,427 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:06,428 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:06,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:06,428 INFO L85 PathProgramCache]: Analyzing trace with hash -47631820, now seen corresponding path program 1 times [2022-04-07 19:20:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:06,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69754277] [2022-04-07 19:20:06,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:06,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:06,443 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:06,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [62664626] [2022-04-07 19:20:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:06,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:06,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:06,445 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:20:06,451 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:20:06,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:06,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-07 19:20:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:06,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:06,799 INFO L272 TraceCheckUtils]: 0: Hoare triple {3510#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:06,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {3510#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {3510#true} is VALID [2022-04-07 19:20:06,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {3510#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:06,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3510#true} {3510#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:06,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {3510#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:06,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {3510#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3510#true} is VALID [2022-04-07 19:20:06,800 INFO L272 TraceCheckUtils]: 6: Hoare triple {3510#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {3510#true} is VALID [2022-04-07 19:20:06,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {3510#true} [119] 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] {3536#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-07 19:20:06,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {3536#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [122] 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[] {3540#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:06,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {3540#(not (= |assume_abort_if_not_#in~cond| 0))} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3540#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-07 19:20:06,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3540#(not (= |assume_abort_if_not_#in~cond| 0))} {3510#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {3547#(<= 1 main_~x~0)} is VALID [2022-04-07 19:20:06,802 INFO L272 TraceCheckUtils]: 11: Hoare triple {3547#(<= 1 main_~x~0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {3510#true} is VALID [2022-04-07 19:20:06,802 INFO L290 TraceCheckUtils]: 12: Hoare triple {3510#true} [119] 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] {3510#true} is VALID [2022-04-07 19:20:06,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {3510#true} [122] 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[] {3510#true} is VALID [2022-04-07 19:20:06,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {3510#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:06,803 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3510#true} {3547#(<= 1 main_~x~0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {3547#(<= 1 main_~x~0)} is VALID [2022-04-07 19:20:06,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {3547#(<= 1 main_~x~0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3566#(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:20:06,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {3566#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3566#(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:20:06,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {3566#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3566#(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:20:06,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {3566#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3566#(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:20:06,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {3566#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [137] L41-3-->L41-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] {3566#(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:20:06,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {3566#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3566#(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:20:06,806 INFO L290 TraceCheckUtils]: 22: Hoare triple {3566#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {3566#(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:20:06,807 INFO L290 TraceCheckUtils]: 23: Hoare triple {3566#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:06,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:06,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:06,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:06,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [137] L41-3-->L41-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] {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:06,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:06,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:06,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:06,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:06,811 INFO L272 TraceCheckUtils]: 32: Hoare triple {3588#(and (<= 1 main_~x~0) (= main_~p~0 0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:06,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {3616#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {3620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:06,812 INFO L290 TraceCheckUtils]: 34: Hoare triple {3620#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {3511#false} is VALID [2022-04-07 19:20:06,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {3511#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3511#false} is VALID [2022-04-07 19:20:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-07 19:20:06,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:20:07,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {3511#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3511#false} is VALID [2022-04-07 19:20:07,018 INFO L290 TraceCheckUtils]: 34: Hoare triple {3620#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {3511#false} is VALID [2022-04-07 19:20:07,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {3616#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {3620#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:07,019 INFO L272 TraceCheckUtils]: 32: Hoare triple {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3616#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:07,020 INFO L290 TraceCheckUtils]: 31: Hoare triple {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:07,020 INFO L290 TraceCheckUtils]: 30: Hoare triple {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:07,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:07,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:07,022 INFO L290 TraceCheckUtils]: 27: Hoare triple {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [137] L41-3-->L41-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] {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:07,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:07,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:07,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:07,024 INFO L290 TraceCheckUtils]: 23: Hoare triple {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3636#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:07,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:07,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:07,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L41-3-->L41-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] {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:07,026 INFO L290 TraceCheckUtils]: 19: Hoare triple {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:07,026 INFO L290 TraceCheckUtils]: 18: Hoare triple {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:07,027 INFO L290 TraceCheckUtils]: 17: Hoare triple {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:07,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {3510#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3664#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:07,027 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3510#true} {3510#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {3510#true} is VALID [2022-04-07 19:20:07,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {3510#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:07,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {3510#true} [122] 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[] {3510#true} is VALID [2022-04-07 19:20:07,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {3510#true} [119] 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] {3510#true} is VALID [2022-04-07 19:20:07,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {3510#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {3510#true} is VALID [2022-04-07 19:20:07,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3510#true} {3510#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {3510#true} is VALID [2022-04-07 19:20:07,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {3510#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:07,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {3510#true} [122] 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[] {3510#true} is VALID [2022-04-07 19:20:07,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {3510#true} [119] 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] {3510#true} is VALID [2022-04-07 19:20:07,029 INFO L272 TraceCheckUtils]: 6: Hoare triple {3510#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {3510#true} is VALID [2022-04-07 19:20:07,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {3510#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3510#true} is VALID [2022-04-07 19:20:07,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {3510#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:07,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3510#true} {3510#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:07,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {3510#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:07,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {3510#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {3510#true} is VALID [2022-04-07 19:20:07,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {3510#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3510#true} is VALID [2022-04-07 19:20:07,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:20:07,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:07,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69754277] [2022-04-07 19:20:07,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:07,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62664626] [2022-04-07 19:20:07,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62664626] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:20:07,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:20:07,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 11 [2022-04-07 19:20:07,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313672196] [2022-04-07 19:20:07,031 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:20:07,031 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-07 19:20:07,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:07,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:07,081 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:07,081 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-07 19:20:07,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:07,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-07 19:20:07,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:20:07,082 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:07,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:07,670 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2022-04-07 19:20:07,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-07 19:20:07,671 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2022-04-07 19:20:07,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:07,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:07,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-07 19:20:07,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:07,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2022-04-07 19:20:07,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2022-04-07 19:20:07,753 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:07,756 INFO L225 Difference]: With dead ends: 176 [2022-04-07 19:20:07,756 INFO L226 Difference]: Without dead ends: 176 [2022-04-07 19:20:07,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-04-07 19:20:07,757 INFO L913 BasicCegarLoop]: 58 mSDtfsCounter, 92 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:07,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 321 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-07 19:20:07,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-07 19:20:07,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 173. [2022-04-07 19:20:07,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:07,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:20:07,763 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:20:07,763 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:20:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:07,768 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2022-04-07 19:20:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 237 transitions. [2022-04-07 19:20:07,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:07,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:07,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 176 states. [2022-04-07 19:20:07,770 INFO L87 Difference]: Start difference. First operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 176 states. [2022-04-07 19:20:07,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:07,774 INFO L93 Difference]: Finished difference Result 176 states and 237 transitions. [2022-04-07 19:20:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 237 transitions. [2022-04-07 19:20:07,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:07,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:07,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:07,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:07,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.3385826771653544) internal successors, (170), 129 states have internal predecessors, (170), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:20:07,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 234 transitions. [2022-04-07 19:20:07,779 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 234 transitions. Word has length 36 [2022-04-07 19:20:07,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:07,779 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 234 transitions. [2022-04-07 19:20:07,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.0) internal successors, (44), 9 states have internal predecessors, (44), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:07,780 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 234 transitions. [2022-04-07 19:20:07,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-07 19:20:07,780 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:07,780 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2022-04-07 19:20:07,801 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:20:07,995 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,SelfDestructingSolverStorable8 [2022-04-07 19:20:07,996 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:07,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:07,996 INFO L85 PathProgramCache]: Analyzing trace with hash -375710268, now seen corresponding path program 1 times [2022-04-07 19:20:07,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:07,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416651577] [2022-04-07 19:20:07,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:07,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:08,012 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:08,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1553507861] [2022-04-07 19:20:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:08,013 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:08,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:08,014 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:20:08,015 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:20:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:08,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-07 19:20:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:08,064 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:08,226 INFO L272 TraceCheckUtils]: 0: Hoare triple {4443#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4443#true} is VALID [2022-04-07 19:20:08,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {4443#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {4451#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,228 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4451#(<= ~counter~0 0)} {4443#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,228 INFO L272 TraceCheckUtils]: 4: Hoare triple {4451#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {4451#(<= ~counter~0 0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,233 INFO L272 TraceCheckUtils]: 6: Hoare triple {4451#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,234 INFO L290 TraceCheckUtils]: 7: Hoare triple {4451#(<= ~counter~0 0)} [119] 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] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,234 INFO L290 TraceCheckUtils]: 8: Hoare triple {4451#(<= ~counter~0 0)} [122] 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[] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {4451#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,235 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4451#(<= ~counter~0 0)} {4451#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,236 INFO L272 TraceCheckUtils]: 11: Hoare triple {4451#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {4451#(<= ~counter~0 0)} [119] 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] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,239 INFO L290 TraceCheckUtils]: 13: Hoare triple {4451#(<= ~counter~0 0)} [122] 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[] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,239 INFO L290 TraceCheckUtils]: 14: Hoare triple {4451#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,240 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4451#(<= ~counter~0 0)} {4451#(<= ~counter~0 0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {4451#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4451#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:08,243 INFO L290 TraceCheckUtils]: 17: Hoare triple {4451#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4500#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:08,244 INFO L290 TraceCheckUtils]: 18: Hoare triple {4500#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4500#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:08,244 INFO L290 TraceCheckUtils]: 19: Hoare triple {4500#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4500#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:08,244 INFO L290 TraceCheckUtils]: 20: Hoare triple {4500#(<= ~counter~0 1)} [137] L41-3-->L41-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] {4510#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:08,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {4510#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4510#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:08,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {4510#(<= ~counter~0 2)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {4510#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:08,245 INFO L290 TraceCheckUtils]: 23: Hoare triple {4510#(<= ~counter~0 2)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {4520#(<= |main_#t~post8| 2)} is VALID [2022-04-07 19:20:08,246 INFO L290 TraceCheckUtils]: 24: Hoare triple {4520#(<= |main_#t~post8| 2)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 5)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {4444#false} is VALID [2022-04-07 19:20:08,246 INFO L290 TraceCheckUtils]: 25: Hoare triple {4444#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {4444#false} is VALID [2022-04-07 19:20:08,246 INFO L290 TraceCheckUtils]: 26: Hoare triple {4444#false} [137] L41-3-->L41-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] {4444#false} is VALID [2022-04-07 19:20:08,246 INFO L290 TraceCheckUtils]: 27: Hoare triple {4444#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {4444#false} is VALID [2022-04-07 19:20:08,246 INFO L290 TraceCheckUtils]: 28: Hoare triple {4444#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {4444#false} is VALID [2022-04-07 19:20:08,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {4444#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {4444#false} is VALID [2022-04-07 19:20:08,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {4444#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {4444#false} is VALID [2022-04-07 19:20:08,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {4444#false} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {4444#false} is VALID [2022-04-07 19:20:08,246 INFO L272 TraceCheckUtils]: 32: Hoare triple {4444#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {4444#false} is VALID [2022-04-07 19:20:08,246 INFO L290 TraceCheckUtils]: 33: Hoare triple {4444#false} [130] __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] {4444#false} is VALID [2022-04-07 19:20:08,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {4444#false} [134] 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[] {4444#false} is VALID [2022-04-07 19:20:08,247 INFO L290 TraceCheckUtils]: 35: Hoare triple {4444#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {4444#false} is VALID [2022-04-07 19:20:08,247 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:20:08,247 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:20:08,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:08,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416651577] [2022-04-07 19:20:08,247 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:08,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553507861] [2022-04-07 19:20:08,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553507861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:20:08,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:20:08,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-07 19:20:08,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893799011] [2022-04-07 19:20:08,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:20:08,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-07 19:20:08,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:08,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:08,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:08,272 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-07 19:20:08,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:08,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-07 19:20:08,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:20:08,273 INFO L87 Difference]: Start difference. First operand 173 states and 234 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:08,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:08,387 INFO L93 Difference]: Finished difference Result 173 states and 233 transitions. [2022-04-07 19:20:08,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:20:08,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2022-04-07 19:20:08,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:08,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-07 19:20:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 57 transitions. [2022-04-07 19:20:08,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 57 transitions. [2022-04-07 19:20:08,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:08,440 INFO L225 Difference]: With dead ends: 173 [2022-04-07 19:20:08,440 INFO L226 Difference]: Without dead ends: 173 [2022-04-07 19:20:08,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:20:08,441 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 16 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:08,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 119 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:20:08,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-07 19:20:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-07 19:20:08,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:08,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:20:08,453 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:20:08,454 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:20:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:08,458 INFO L93 Difference]: Finished difference Result 173 states and 233 transitions. [2022-04-07 19:20:08,458 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-04-07 19:20:08,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:08,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:08,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 173 states. [2022-04-07 19:20:08,460 INFO L87 Difference]: Start difference. First operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand 173 states. [2022-04-07 19:20:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:08,464 INFO L93 Difference]: Finished difference Result 173 states and 233 transitions. [2022-04-07 19:20:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-04-07 19:20:08,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:08,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:08,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:08,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:08,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 127 states have (on average 1.330708661417323) internal successors, (169), 129 states have internal predecessors, (169), 33 states have call successors, (33), 13 states have call predecessors, (33), 12 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-07 19:20:08,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 233 transitions. [2022-04-07 19:20:08,470 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 233 transitions. Word has length 36 [2022-04-07 19:20:08,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:08,470 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 233 transitions. [2022-04-07 19:20:08,470 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-07 19:20:08,470 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 233 transitions. [2022-04-07 19:20:08,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-07 19:20:08,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:08,471 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 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] [2022-04-07 19:20:08,495 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:20:08,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-07 19:20:08,687 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:08,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:08,688 INFO L85 PathProgramCache]: Analyzing trace with hash -344890017, now seen corresponding path program 1 times [2022-04-07 19:20:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:08,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888360524] [2022-04-07 19:20:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:08,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:08,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1118548145] [2022-04-07 19:20:08,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:08,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:08,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:08,702 INFO L229 MonitoredProcess]: Starting monitored process 11 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:20:08,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-07 19:20:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:08,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:20:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:08,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:08,893 INFO L272 TraceCheckUtils]: 0: Hoare triple {5248#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5248#true} is VALID [2022-04-07 19:20:08,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {5248#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {5248#true} is VALID [2022-04-07 19:20:08,893 INFO L290 TraceCheckUtils]: 2: Hoare triple {5248#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5248#true} is VALID [2022-04-07 19:20:08,893 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5248#true} {5248#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5248#true} is VALID [2022-04-07 19:20:08,893 INFO L272 TraceCheckUtils]: 4: Hoare triple {5248#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L290 TraceCheckUtils]: 5: Hoare triple {5248#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L272 TraceCheckUtils]: 6: Hoare triple {5248#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L290 TraceCheckUtils]: 7: Hoare triple {5248#true} [119] 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] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {5248#true} [122] 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[] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {5248#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5248#true} {5248#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L272 TraceCheckUtils]: 11: Hoare triple {5248#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L290 TraceCheckUtils]: 12: Hoare triple {5248#true} [119] 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] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L290 TraceCheckUtils]: 13: Hoare triple {5248#true} [122] 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[] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {5248#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5248#true} {5248#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {5248#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {5248#true} is VALID [2022-04-07 19:20:08,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {5248#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {5248#true} is VALID [2022-04-07 19:20:08,895 INFO L290 TraceCheckUtils]: 18: Hoare triple {5248#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {5248#true} is VALID [2022-04-07 19:20:08,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {5248#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:20:08,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [137] L41-3-->L41-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] {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:20:08,896 INFO L290 TraceCheckUtils]: 21: Hoare triple {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:20:08,896 INFO L290 TraceCheckUtils]: 22: Hoare triple {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:20:08,897 INFO L290 TraceCheckUtils]: 23: Hoare triple {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:20:08,897 INFO L290 TraceCheckUtils]: 24: Hoare triple {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:20:08,897 INFO L272 TraceCheckUtils]: 25: Hoare triple {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5248#true} is VALID [2022-04-07 19:20:08,897 INFO L290 TraceCheckUtils]: 26: Hoare triple {5248#true} [130] __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] {5248#true} is VALID [2022-04-07 19:20:08,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {5248#true} [135] 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[] {5248#true} is VALID [2022-04-07 19:20:08,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {5248#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5248#true} is VALID [2022-04-07 19:20:08,898 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5248#true} {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:20:08,898 INFO L272 TraceCheckUtils]: 30: Hoare triple {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5248#true} is VALID [2022-04-07 19:20:08,898 INFO L290 TraceCheckUtils]: 31: Hoare triple {5248#true} [130] __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] {5248#true} is VALID [2022-04-07 19:20:08,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {5248#true} [135] 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[] {5248#true} is VALID [2022-04-07 19:20:08,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {5248#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5248#true} is VALID [2022-04-07 19:20:08,899 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {5248#true} {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} is VALID [2022-04-07 19:20:08,900 INFO L272 TraceCheckUtils]: 35: Hoare triple {5310#(and (= main_~c~0 main_~a~0) (= main_~k~0 0))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {5359#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:08,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {5359#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {5363#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:08,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {5363#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {5249#false} is VALID [2022-04-07 19:20:08,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {5249#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {5249#false} is VALID [2022-04-07 19:20:08,901 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-07 19:20:08,901 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:20:08,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:08,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888360524] [2022-04-07 19:20:08,901 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:08,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118548145] [2022-04-07 19:20:08,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118548145] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:20:08,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:20:08,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:20:08,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875642744] [2022-04-07 19:20:08,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:20:08,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-07 19:20:08,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:08,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:08,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:08,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:20:08,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:08,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:20:08,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:20:08,926 INFO L87 Difference]: Start difference. First operand 173 states and 233 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:09,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:09,083 INFO L93 Difference]: Finished difference Result 236 states and 329 transitions. [2022-04-07 19:20:09,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:20:09,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 39 [2022-04-07 19:20:09,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:09,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 19:20:09,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:09,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 19:20:09,086 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 19:20:09,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:09,160 INFO L225 Difference]: With dead ends: 236 [2022-04-07 19:20:09,160 INFO L226 Difference]: Without dead ends: 236 [2022-04-07 19:20:09,160 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:20:09,161 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 10 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 150 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.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:09,161 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 150 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:20:09,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-04-07 19:20:09,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 229. [2022-04-07 19:20:09,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:09,173 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 19:20:09,173 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 19:20:09,174 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 19:20:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:09,180 INFO L93 Difference]: Finished difference Result 236 states and 329 transitions. [2022-04-07 19:20:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 329 transitions. [2022-04-07 19:20:09,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:09,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:09,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 236 states. [2022-04-07 19:20:09,182 INFO L87 Difference]: Start difference. First operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) Second operand 236 states. [2022-04-07 19:20:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:09,190 INFO L93 Difference]: Finished difference Result 236 states and 329 transitions. [2022-04-07 19:20:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 329 transitions. [2022-04-07 19:20:09,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:09,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:09,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:09,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 160 states have (on average 1.3625) internal successors, (218), 162 states have internal predecessors, (218), 53 states have call successors, (53), 16 states have call predecessors, (53), 15 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2022-04-07 19:20:09,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 322 transitions. [2022-04-07 19:20:09,198 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 322 transitions. Word has length 39 [2022-04-07 19:20:09,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:09,199 INFO L478 AbstractCegarLoop]: Abstraction has 229 states and 322 transitions. [2022-04-07 19:20:09,199 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 322 transitions. [2022-04-07 19:20:09,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-07 19:20:09,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:09,199 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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] [2022-04-07 19:20:09,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:09,423 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-07 19:20:09,423 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:09,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:09,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1057809952, now seen corresponding path program 1 times [2022-04-07 19:20:09,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:09,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326679421] [2022-04-07 19:20:09,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:09,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:09,436 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:09,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [857303058] [2022-04-07 19:20:09,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:09,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:09,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:09,437 INFO L229 MonitoredProcess]: Starting monitored process 12 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:20:09,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-07 19:20:09,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:09,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-07 19:20:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:09,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:09,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {6308#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:09,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {6308#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {6308#true} is VALID [2022-04-07 19:20:09,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {6308#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:09,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6308#true} {6308#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:09,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {6308#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:09,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {6308#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6308#true} is VALID [2022-04-07 19:20:09,840 INFO L272 TraceCheckUtils]: 6: Hoare triple {6308#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {6308#true} is VALID [2022-04-07 19:20:09,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {6308#true} [119] 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] {6308#true} is VALID [2022-04-07 19:20:09,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {6308#true} [122] 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[] {6308#true} is VALID [2022-04-07 19:20:09,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {6308#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:09,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6308#true} {6308#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {6308#true} is VALID [2022-04-07 19:20:09,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {6308#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {6308#true} is VALID [2022-04-07 19:20:09,841 INFO L290 TraceCheckUtils]: 12: Hoare triple {6308#true} [119] 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] {6308#true} is VALID [2022-04-07 19:20:09,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {6308#true} [122] 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[] {6308#true} is VALID [2022-04-07 19:20:09,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {6308#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:09,841 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6308#true} {6308#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {6308#true} is VALID [2022-04-07 19:20:09,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {6308#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6361#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:09,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {6361#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6361#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:09,843 INFO L290 TraceCheckUtils]: 18: Hoare triple {6361#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6361#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:09,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {6361#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6371#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:09,844 INFO L290 TraceCheckUtils]: 20: Hoare triple {6371#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-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] {6371#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:09,844 INFO L290 TraceCheckUtils]: 21: Hoare triple {6371#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6371#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:09,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {6371#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {6371#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:09,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {6371#(and (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,847 INFO L290 TraceCheckUtils]: 27: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [137] L41-3-->L41-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] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,849 INFO L290 TraceCheckUtils]: 30: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,849 INFO L290 TraceCheckUtils]: 31: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,849 INFO L272 TraceCheckUtils]: 32: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6308#true} is VALID [2022-04-07 19:20:09,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {6308#true} [130] __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] {6308#true} is VALID [2022-04-07 19:20:09,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {6308#true} [135] 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[] {6308#true} is VALID [2022-04-07 19:20:09,850 INFO L290 TraceCheckUtils]: 35: Hoare triple {6308#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:09,850 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6308#true} {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} is VALID [2022-04-07 19:20:09,855 INFO L272 TraceCheckUtils]: 37: Hoare triple {6384#(and (= main_~s~0 0) (= main_~b~0 main_~x~0) (= main_~q~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:09,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {6427#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {6431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:09,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {6431#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {6309#false} is VALID [2022-04-07 19:20:09,856 INFO L290 TraceCheckUtils]: 40: Hoare triple {6309#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6309#false} is VALID [2022-04-07 19:20:09,857 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:20:09,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:20:10,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {6309#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6309#false} is VALID [2022-04-07 19:20:10,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {6431#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {6309#false} is VALID [2022-04-07 19:20:10,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {6427#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {6431#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:10,061 INFO L272 TraceCheckUtils]: 37: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {6427#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:10,061 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {6308#true} {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:10,061 INFO L290 TraceCheckUtils]: 35: Hoare triple {6308#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:10,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {6308#true} [135] 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[] {6308#true} is VALID [2022-04-07 19:20:10,062 INFO L290 TraceCheckUtils]: 33: Hoare triple {6308#true} [130] __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] {6308#true} is VALID [2022-04-07 19:20:10,062 INFO L272 TraceCheckUtils]: 32: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {6308#true} is VALID [2022-04-07 19:20:10,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:10,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:10,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:10,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:10,065 INFO L290 TraceCheckUtils]: 27: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [137] L41-3-->L41-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] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:10,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:10,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:10,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-07 19:20:12,080 WARN L290 TraceCheckUtils]: 23: Hoare triple {6490#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6447#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is UNKNOWN [2022-04-07 19:20:12,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {6490#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {6490#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-07 19:20:12,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {6490#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {6490#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-07 19:20:12,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {6490#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} [137] L41-3-->L41-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] {6490#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-07 19:20:12,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {6503#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {6490#(= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) main_~c~0)} is VALID [2022-04-07 19:20:12,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {6503#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {6503#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:12,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {6503#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {6503#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:12,083 INFO L290 TraceCheckUtils]: 16: Hoare triple {6308#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6503#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:20:12,083 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6308#true} {6308#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {6308#true} is VALID [2022-04-07 19:20:12,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {6308#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:12,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {6308#true} [122] 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[] {6308#true} is VALID [2022-04-07 19:20:12,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {6308#true} [119] 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] {6308#true} is VALID [2022-04-07 19:20:12,084 INFO L272 TraceCheckUtils]: 11: Hoare triple {6308#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {6308#true} is VALID [2022-04-07 19:20:12,084 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6308#true} {6308#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {6308#true} is VALID [2022-04-07 19:20:12,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {6308#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:12,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {6308#true} [122] 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[] {6308#true} is VALID [2022-04-07 19:20:12,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {6308#true} [119] 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] {6308#true} is VALID [2022-04-07 19:20:12,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {6308#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {6308#true} is VALID [2022-04-07 19:20:12,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {6308#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {6308#true} is VALID [2022-04-07 19:20:12,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {6308#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:12,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6308#true} {6308#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:12,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {6308#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:12,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {6308#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {6308#true} is VALID [2022-04-07 19:20:12,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {6308#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {6308#true} is VALID [2022-04-07 19:20:12,085 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:20:12,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:12,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326679421] [2022-04-07 19:20:12,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:12,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857303058] [2022-04-07 19:20:12,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857303058] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:20:12,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:20:12,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-07 19:20:12,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704565407] [2022-04-07 19:20:12,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:20:12,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-07 19:20:12,087 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:12,087 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:20:12,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:12,213 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-07 19:20:12,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:12,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-07 19:20:12,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:20:12,214 INFO L87 Difference]: Start difference. First operand 229 states and 322 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:20:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:13,923 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2022-04-07 19:20:13,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-07 19:20:13,923 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 41 [2022-04-07 19:20:13,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:20:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 251 transitions. [2022-04-07 19:20:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:20:13,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 251 transitions. [2022-04-07 19:20:13,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 251 transitions. [2022-04-07 19:20:14,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:14,413 INFO L225 Difference]: With dead ends: 389 [2022-04-07 19:20:14,413 INFO L226 Difference]: Without dead ends: 389 [2022-04-07 19:20:14,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-04-07 19:20:14,414 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 164 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:14,414 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 318 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-07 19:20:14,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2022-04-07 19:20:14,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 376. [2022-04-07 19:20:14,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:14,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 389 states. Second operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-07 19:20:14,426 INFO L74 IsIncluded]: Start isIncluded. First operand 389 states. Second operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-07 19:20:14,426 INFO L87 Difference]: Start difference. First operand 389 states. Second operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-07 19:20:14,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:14,441 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2022-04-07 19:20:14,441 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 574 transitions. [2022-04-07 19:20:14,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:14,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:14,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) Second operand 389 states. [2022-04-07 19:20:14,444 INFO L87 Difference]: Start difference. First operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) Second operand 389 states. [2022-04-07 19:20:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:14,457 INFO L93 Difference]: Finished difference Result 389 states and 574 transitions. [2022-04-07 19:20:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 574 transitions. [2022-04-07 19:20:14,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:14,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:14,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:14,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 265 states have (on average 1.4226415094339622) internal successors, (377), 267 states have internal predecessors, (377), 93 states have call successors, (93), 18 states have call predecessors, (93), 17 states have return successors, (91), 90 states have call predecessors, (91), 91 states have call successors, (91) [2022-04-07 19:20:14,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 561 transitions. [2022-04-07 19:20:14,472 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 561 transitions. Word has length 41 [2022-04-07 19:20:14,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:14,473 INFO L478 AbstractCegarLoop]: Abstraction has 376 states and 561 transitions. [2022-04-07 19:20:14,473 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-07 19:20:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 561 transitions. [2022-04-07 19:20:14,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-04-07 19:20:14,474 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:14,474 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 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, 1] [2022-04-07 19:20:14,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:14,687 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-07 19:20:14,687 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:14,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:14,688 INFO L85 PathProgramCache]: Analyzing trace with hash -800046763, now seen corresponding path program 1 times [2022-04-07 19:20:14,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:14,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341678505] [2022-04-07 19:20:14,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:14,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:14,701 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:14,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1301958351] [2022-04-07 19:20:14,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:14,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:14,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:14,712 INFO L229 MonitoredProcess]: Starting monitored process 13 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:20:14,737 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-07 19:20:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:14,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-07 19:20:14,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:14,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:14,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {8122#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8122#true} is VALID [2022-04-07 19:20:14,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {8122#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {8122#true} is VALID [2022-04-07 19:20:14,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {8122#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8122#true} is VALID [2022-04-07 19:20:14,910 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8122#true} {8122#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8122#true} is VALID [2022-04-07 19:20:14,910 INFO L272 TraceCheckUtils]: 4: Hoare triple {8122#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8122#true} is VALID [2022-04-07 19:20:14,911 INFO L290 TraceCheckUtils]: 5: Hoare triple {8122#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {8122#true} is VALID [2022-04-07 19:20:14,911 INFO L272 TraceCheckUtils]: 6: Hoare triple {8122#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {8122#true} is VALID [2022-04-07 19:20:14,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {8122#true} [119] 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] {8122#true} is VALID [2022-04-07 19:20:14,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {8122#true} [122] 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[] {8122#true} is VALID [2022-04-07 19:20:14,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {8122#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8122#true} is VALID [2022-04-07 19:20:14,911 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8122#true} {8122#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {8122#true} is VALID [2022-04-07 19:20:14,911 INFO L272 TraceCheckUtils]: 11: Hoare triple {8122#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {8122#true} is VALID [2022-04-07 19:20:14,911 INFO L290 TraceCheckUtils]: 12: Hoare triple {8122#true} [119] 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] {8122#true} is VALID [2022-04-07 19:20:14,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {8122#true} [122] 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[] {8122#true} is VALID [2022-04-07 19:20:14,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {8122#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8122#true} is VALID [2022-04-07 19:20:14,912 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8122#true} {8122#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {8122#true} is VALID [2022-04-07 19:20:14,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {8122#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {8122#true} is VALID [2022-04-07 19:20:14,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {8122#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {8122#true} is VALID [2022-04-07 19:20:14,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {8122#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {8122#true} is VALID [2022-04-07 19:20:14,912 INFO L290 TraceCheckUtils]: 19: Hoare triple {8122#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {8122#true} is VALID [2022-04-07 19:20:14,912 INFO L290 TraceCheckUtils]: 20: Hoare triple {8122#true} [137] L41-3-->L41-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] {8122#true} is VALID [2022-04-07 19:20:14,912 INFO L290 TraceCheckUtils]: 21: Hoare triple {8122#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {8122#true} is VALID [2022-04-07 19:20:14,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {8122#true} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:14,913 INFO L290 TraceCheckUtils]: 23: Hoare triple {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:14,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:14,914 INFO L272 TraceCheckUtils]: 25: Hoare triple {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8122#true} is VALID [2022-04-07 19:20:14,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {8122#true} [130] __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] {8122#true} is VALID [2022-04-07 19:20:14,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {8122#true} [135] 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[] {8122#true} is VALID [2022-04-07 19:20:14,914 INFO L290 TraceCheckUtils]: 28: Hoare triple {8122#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8122#true} is VALID [2022-04-07 19:20:14,915 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8122#true} {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:14,915 INFO L272 TraceCheckUtils]: 30: Hoare triple {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8122#true} is VALID [2022-04-07 19:20:14,915 INFO L290 TraceCheckUtils]: 31: Hoare triple {8122#true} [130] __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] {8122#true} is VALID [2022-04-07 19:20:14,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {8122#true} [135] 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[] {8122#true} is VALID [2022-04-07 19:20:14,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {8122#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8122#true} is VALID [2022-04-07 19:20:14,916 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {8122#true} {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:14,916 INFO L272 TraceCheckUtils]: 35: Hoare triple {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {8122#true} is VALID [2022-04-07 19:20:14,917 INFO L290 TraceCheckUtils]: 36: Hoare triple {8122#true} [130] __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] {8122#true} is VALID [2022-04-07 19:20:14,917 INFO L290 TraceCheckUtils]: 37: Hoare triple {8122#true} [135] 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[] {8122#true} is VALID [2022-04-07 19:20:14,917 INFO L290 TraceCheckUtils]: 38: Hoare triple {8122#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8122#true} is VALID [2022-04-07 19:20:14,917 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8122#true} {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} is VALID [2022-04-07 19:20:14,918 INFO L272 TraceCheckUtils]: 40: Hoare triple {8193#(and (= main_~b~0 main_~v~0) (= main_~d~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {8248#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:14,919 INFO L290 TraceCheckUtils]: 41: Hoare triple {8248#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {8252#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:14,919 INFO L290 TraceCheckUtils]: 42: Hoare triple {8252#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {8123#false} is VALID [2022-04-07 19:20:14,919 INFO L290 TraceCheckUtils]: 43: Hoare triple {8123#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {8123#false} is VALID [2022-04-07 19:20:14,919 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 19:20:14,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:20:14,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:14,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341678505] [2022-04-07 19:20:14,920 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:14,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301958351] [2022-04-07 19:20:14,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301958351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:20:14,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:20:14,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:20:14,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535321565] [2022-04-07 19:20:14,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:20:14,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-07 19:20:14,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:14,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:20:14,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:14,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:20:14,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:14,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:20:14,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:20:14,948 INFO L87 Difference]: Start difference. First operand 376 states and 561 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:20:15,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:15,158 INFO L93 Difference]: Finished difference Result 558 states and 875 transitions. [2022-04-07 19:20:15,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-07 19:20:15,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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 44 [2022-04-07 19:20:15,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:15,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:20:15,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 19:20:15,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:20:15,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2022-04-07 19:20:15,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2022-04-07 19:20:15,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:15,239 INFO L225 Difference]: With dead ends: 558 [2022-04-07 19:20:15,239 INFO L226 Difference]: Without dead ends: 558 [2022-04-07 19:20:15,239 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-07 19:20:15,239 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:15,240 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 166 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-07 19:20:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2022-04-07 19:20:15,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 494. [2022-04-07 19:20:15,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:15,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 558 states. Second operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:15,257 INFO L74 IsIncluded]: Start isIncluded. First operand 558 states. Second operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:15,258 INFO L87 Difference]: Start difference. First operand 558 states. Second operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:15,284 INFO L93 Difference]: Finished difference Result 558 states and 875 transitions. [2022-04-07 19:20:15,284 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 875 transitions. [2022-04-07 19:20:15,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:15,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:15,288 INFO L74 IsIncluded]: Start isIncluded. First operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) Second operand 558 states. [2022-04-07 19:20:15,289 INFO L87 Difference]: Start difference. First operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) Second operand 558 states. [2022-04-07 19:20:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:15,316 INFO L93 Difference]: Finished difference Result 558 states and 875 transitions. [2022-04-07 19:20:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 875 transitions. [2022-04-07 19:20:15,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:15,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:15,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:15,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:15,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 306 states have (on average 1.4248366013071896) internal successors, (436), 327 states have internal predecessors, (436), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 147 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:15,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 772 transitions. [2022-04-07 19:20:15,342 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 772 transitions. Word has length 44 [2022-04-07 19:20:15,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:15,342 INFO L478 AbstractCegarLoop]: Abstraction has 494 states and 772 transitions. [2022-04-07 19:20:15,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 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:20:15,344 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 772 transitions. [2022-04-07 19:20:15,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 19:20:15,344 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:15,344 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:20:15,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:15,567 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-07 19:20:15,568 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:15,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:15,568 INFO L85 PathProgramCache]: Analyzing trace with hash 684933943, now seen corresponding path program 1 times [2022-04-07 19:20:15,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:15,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612675821] [2022-04-07 19:20:15,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:15,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:15,586 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:15,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [135369155] [2022-04-07 19:20:15,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:15,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:15,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:15,594 INFO L229 MonitoredProcess]: Starting monitored process 14 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:20:15,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-07 19:20:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:15,644 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-07 19:20:15,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:15,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:15,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {10428#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10428#true} is VALID [2022-04-07 19:20:15,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {10428#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {10436#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10436#(<= ~counter~0 0)} {10428#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {10436#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {10436#(<= ~counter~0 0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,847 INFO L272 TraceCheckUtils]: 6: Hoare triple {10436#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {10436#(<= ~counter~0 0)} [119] 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] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {10436#(<= ~counter~0 0)} [122] 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[] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,848 INFO L290 TraceCheckUtils]: 9: Hoare triple {10436#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,848 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10436#(<= ~counter~0 0)} {10436#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,849 INFO L272 TraceCheckUtils]: 11: Hoare triple {10436#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,849 INFO L290 TraceCheckUtils]: 12: Hoare triple {10436#(<= ~counter~0 0)} [119] 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] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,849 INFO L290 TraceCheckUtils]: 13: Hoare triple {10436#(<= ~counter~0 0)} [122] 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[] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {10436#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,850 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10436#(<= ~counter~0 0)} {10436#(<= ~counter~0 0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {10436#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10436#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:15,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {10436#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:15,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {10485#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:15,852 INFO L290 TraceCheckUtils]: 19: Hoare triple {10485#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:15,852 INFO L290 TraceCheckUtils]: 20: Hoare triple {10485#(<= ~counter~0 1)} [137] L41-3-->L41-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] {10495#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:15,852 INFO L290 TraceCheckUtils]: 21: Hoare triple {10495#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10495#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:15,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {10495#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {10495#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:15,853 INFO L290 TraceCheckUtils]: 23: Hoare triple {10495#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10495#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:15,853 INFO L290 TraceCheckUtils]: 24: Hoare triple {10495#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10508#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:15,854 INFO L290 TraceCheckUtils]: 25: Hoare triple {10508#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10508#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:15,854 INFO L290 TraceCheckUtils]: 26: Hoare triple {10508#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10508#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:15,855 INFO L290 TraceCheckUtils]: 27: Hoare triple {10508#(<= ~counter~0 3)} [137] L41-3-->L41-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] {10518#(<= |main_#t~post7| 3)} is VALID [2022-04-07 19:20:15,856 INFO L290 TraceCheckUtils]: 28: Hoare triple {10518#(<= |main_#t~post7| 3)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10429#false} is VALID [2022-04-07 19:20:15,856 INFO L290 TraceCheckUtils]: 29: Hoare triple {10429#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10429#false} is VALID [2022-04-07 19:20:15,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {10429#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10429#false} is VALID [2022-04-07 19:20:15,856 INFO L290 TraceCheckUtils]: 31: Hoare triple {10429#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10429#false} is VALID [2022-04-07 19:20:15,856 INFO L290 TraceCheckUtils]: 32: Hoare triple {10429#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10429#false} is VALID [2022-04-07 19:20:15,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {10429#false} [137] L41-3-->L41-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] {10429#false} is VALID [2022-04-07 19:20:15,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {10429#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10429#false} is VALID [2022-04-07 19:20:15,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {10429#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10429#false} is VALID [2022-04-07 19:20:15,856 INFO L290 TraceCheckUtils]: 36: Hoare triple {10429#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10429#false} is VALID [2022-04-07 19:20:15,857 INFO L290 TraceCheckUtils]: 37: Hoare triple {10429#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10429#false} is VALID [2022-04-07 19:20:15,857 INFO L272 TraceCheckUtils]: 38: Hoare triple {10429#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {10429#false} is VALID [2022-04-07 19:20:15,857 INFO L290 TraceCheckUtils]: 39: Hoare triple {10429#false} [130] __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] {10429#false} is VALID [2022-04-07 19:20:15,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {10429#false} [134] 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[] {10429#false} is VALID [2022-04-07 19:20:15,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {10429#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10429#false} is VALID [2022-04-07 19:20:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 19:20:15,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:20:16,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {10429#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10429#false} is VALID [2022-04-07 19:20:16,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {10429#false} [134] 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[] {10429#false} is VALID [2022-04-07 19:20:16,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {10429#false} [130] __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] {10429#false} is VALID [2022-04-07 19:20:16,064 INFO L272 TraceCheckUtils]: 38: Hoare triple {10429#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {10429#false} is VALID [2022-04-07 19:20:16,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {10429#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10429#false} is VALID [2022-04-07 19:20:16,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {10429#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10429#false} is VALID [2022-04-07 19:20:16,065 INFO L290 TraceCheckUtils]: 35: Hoare triple {10429#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10429#false} is VALID [2022-04-07 19:20:16,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {10429#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10429#false} is VALID [2022-04-07 19:20:16,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {10429#false} [137] L41-3-->L41-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] {10429#false} is VALID [2022-04-07 19:20:16,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {10429#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10429#false} is VALID [2022-04-07 19:20:16,065 INFO L290 TraceCheckUtils]: 31: Hoare triple {10429#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10429#false} is VALID [2022-04-07 19:20:16,065 INFO L290 TraceCheckUtils]: 30: Hoare triple {10429#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10429#false} is VALID [2022-04-07 19:20:16,065 INFO L290 TraceCheckUtils]: 29: Hoare triple {10429#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10429#false} is VALID [2022-04-07 19:20:16,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {10600#(< |main_#t~post7| 5)} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10429#false} is VALID [2022-04-07 19:20:16,066 INFO L290 TraceCheckUtils]: 27: Hoare triple {10604#(< ~counter~0 5)} [137] L41-3-->L41-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] {10600#(< |main_#t~post7| 5)} is VALID [2022-04-07 19:20:16,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {10604#(< ~counter~0 5)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10604#(< ~counter~0 5)} is VALID [2022-04-07 19:20:16,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {10604#(< ~counter~0 5)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10604#(< ~counter~0 5)} is VALID [2022-04-07 19:20:16,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {10508#(<= ~counter~0 3)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10604#(< ~counter~0 5)} is VALID [2022-04-07 19:20:16,068 INFO L290 TraceCheckUtils]: 23: Hoare triple {10508#(<= ~counter~0 3)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10508#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:16,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {10508#(<= ~counter~0 3)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {10508#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:16,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {10508#(<= ~counter~0 3)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {10508#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:16,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {10495#(<= ~counter~0 2)} [137] L41-3-->L41-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] {10508#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:16,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {10495#(<= ~counter~0 2)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {10495#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:16,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {10495#(<= ~counter~0 2)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {10495#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:16,071 INFO L290 TraceCheckUtils]: 17: Hoare triple {10485#(<= ~counter~0 1)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {10495#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:16,071 INFO L290 TraceCheckUtils]: 16: Hoare triple {10485#(<= ~counter~0 1)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:16,072 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10428#true} {10485#(<= ~counter~0 1)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:16,072 INFO L290 TraceCheckUtils]: 14: Hoare triple {10428#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10428#true} is VALID [2022-04-07 19:20:16,072 INFO L290 TraceCheckUtils]: 13: Hoare triple {10428#true} [122] 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[] {10428#true} is VALID [2022-04-07 19:20:16,072 INFO L290 TraceCheckUtils]: 12: Hoare triple {10428#true} [119] 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] {10428#true} is VALID [2022-04-07 19:20:16,072 INFO L272 TraceCheckUtils]: 11: Hoare triple {10485#(<= ~counter~0 1)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {10428#true} is VALID [2022-04-07 19:20:16,073 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10428#true} {10485#(<= ~counter~0 1)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:16,073 INFO L290 TraceCheckUtils]: 9: Hoare triple {10428#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10428#true} is VALID [2022-04-07 19:20:16,073 INFO L290 TraceCheckUtils]: 8: Hoare triple {10428#true} [122] 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[] {10428#true} is VALID [2022-04-07 19:20:16,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {10428#true} [119] 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] {10428#true} is VALID [2022-04-07 19:20:16,073 INFO L272 TraceCheckUtils]: 6: Hoare triple {10485#(<= ~counter~0 1)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {10428#true} is VALID [2022-04-07 19:20:16,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {10485#(<= ~counter~0 1)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:16,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {10485#(<= ~counter~0 1)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:16,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10485#(<= ~counter~0 1)} {10428#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:16,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {10485#(<= ~counter~0 1)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:16,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {10428#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {10485#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:16,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {10428#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {10428#true} is VALID [2022-04-07 19:20:16,075 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 19:20:16,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:16,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612675821] [2022-04-07 19:20:16,076 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:16,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [135369155] [2022-04-07 19:20:16,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [135369155] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:20:16,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:20:16,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-04-07 19:20:16,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407004674] [2022-04-07 19:20:16,076 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:20:16,077 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-07 19:20:16,077 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:16,077 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:16,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:16,127 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-07 19:20:16,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:16,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-07 19:20:16,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-07 19:20:16,128 INFO L87 Difference]: Start difference. First operand 494 states and 772 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:16,440 INFO L93 Difference]: Finished difference Result 502 states and 778 transitions. [2022-04-07 19:20:16,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 19:20:16,441 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) Word has length 42 [2022-04-07 19:20:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:16,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2022-04-07 19:20:16,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:16,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 102 transitions. [2022-04-07 19:20:16,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 102 transitions. [2022-04-07 19:20:16,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:16,555 INFO L225 Difference]: With dead ends: 502 [2022-04-07 19:20:16,556 INFO L226 Difference]: Without dead ends: 502 [2022-04-07 19:20:16,556 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-04-07 19:20:16,556 INFO L913 BasicCegarLoop]: 53 mSDtfsCounter, 55 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:16,557 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 264 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:20:16,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2022-04-07 19:20:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 498. [2022-04-07 19:20:16,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:16,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 502 states. Second operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:16,579 INFO L74 IsIncluded]: Start isIncluded. First operand 502 states. Second operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:16,580 INFO L87 Difference]: Start difference. First operand 502 states. Second operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:16,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:16,602 INFO L93 Difference]: Finished difference Result 502 states and 778 transitions. [2022-04-07 19:20:16,602 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 778 transitions. [2022-04-07 19:20:16,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:16,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:16,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 502 states. [2022-04-07 19:20:16,607 INFO L87 Difference]: Start difference. First operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 502 states. [2022-04-07 19:20:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:16,630 INFO L93 Difference]: Finished difference Result 502 states and 778 transitions. [2022-04-07 19:20:16,630 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 778 transitions. [2022-04-07 19:20:16,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:16,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:16,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:16,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:16,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 310 states have (on average 1.4161290322580644) internal successors, (439), 330 states have internal predecessors, (439), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 775 transitions. [2022-04-07 19:20:16,657 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 775 transitions. Word has length 42 [2022-04-07 19:20:16,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:16,657 INFO L478 AbstractCegarLoop]: Abstraction has 498 states and 775 transitions. [2022-04-07 19:20:16,657 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 4 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 2 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-07 19:20:16,657 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 775 transitions. [2022-04-07 19:20:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-07 19:20:16,658 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:16,658 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 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:20:16,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:16,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-07 19:20:16,882 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:16,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:16,882 INFO L85 PathProgramCache]: Analyzing trace with hash -982799261, now seen corresponding path program 1 times [2022-04-07 19:20:16,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:16,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864110424] [2022-04-07 19:20:16,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:16,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:16,901 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:16,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518139313] [2022-04-07 19:20:16,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:16,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:16,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:16,905 INFO L229 MonitoredProcess]: Starting monitored process 15 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:20:16,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-07 19:20:16,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:16,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-07 19:20:16,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:16,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:17,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {12696#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12696#true} is VALID [2022-04-07 19:20:17,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {12696#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {12704#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,190 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12704#(<= ~counter~0 0)} {12696#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {12704#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {12704#(<= ~counter~0 0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,191 INFO L272 TraceCheckUtils]: 6: Hoare triple {12704#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,192 INFO L290 TraceCheckUtils]: 7: Hoare triple {12704#(<= ~counter~0 0)} [119] 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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,192 INFO L290 TraceCheckUtils]: 8: Hoare triple {12704#(<= ~counter~0 0)} [122] 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[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {12704#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,195 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12704#(<= ~counter~0 0)} {12704#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,196 INFO L272 TraceCheckUtils]: 11: Hoare triple {12704#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {12704#(<= ~counter~0 0)} [119] 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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {12704#(<= ~counter~0 0)} [122] 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[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {12704#(<= ~counter~0 0)} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,199 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12704#(<= ~counter~0 0)} {12704#(<= ~counter~0 0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {12704#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {12704#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12753#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:17,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {12753#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12753#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:17,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {12753#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12753#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:17,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {12753#(<= ~counter~0 1)} [137] L41-3-->L41-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] {12763#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:17,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {12763#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12763#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:17,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {12763#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {12763#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:17,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {12763#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12763#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:17,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {12763#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12776#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:17,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {12776#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12776#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:17,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {12776#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12776#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:17,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {12776#(<= ~counter~0 3)} [137] L41-3-->L41-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] {12786#(<= ~counter~0 4)} is VALID [2022-04-07 19:20:17,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {12786#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12786#(<= ~counter~0 4)} is VALID [2022-04-07 19:20:17,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {12786#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {12786#(<= ~counter~0 4)} is VALID [2022-04-07 19:20:17,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {12786#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {12796#(<= |main_#t~post8| 4)} is VALID [2022-04-07 19:20:17,210 INFO L290 TraceCheckUtils]: 31: Hoare triple {12796#(<= |main_#t~post8| 4)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 5)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {12697#false} is VALID [2022-04-07 19:20:17,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {12697#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12697#false} is VALID [2022-04-07 19:20:17,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {12697#false} [137] L41-3-->L41-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] {12697#false} is VALID [2022-04-07 19:20:17,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {12697#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12697#false} is VALID [2022-04-07 19:20:17,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {12697#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12697#false} is VALID [2022-04-07 19:20:17,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {12697#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12697#false} is VALID [2022-04-07 19:20:17,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {12697#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12697#false} is VALID [2022-04-07 19:20:17,210 INFO L272 TraceCheckUtils]: 38: Hoare triple {12697#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {12697#false} is VALID [2022-04-07 19:20:17,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {12697#false} [130] __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] {12697#false} is VALID [2022-04-07 19:20:17,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {12697#false} [134] 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[] {12697#false} is VALID [2022-04-07 19:20:17,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {12697#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12697#false} is VALID [2022-04-07 19:20:17,211 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:20:17,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:20:17,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {12697#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12697#false} is VALID [2022-04-07 19:20:17,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {12697#false} [134] 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[] {12697#false} is VALID [2022-04-07 19:20:17,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {12697#false} [130] __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] {12697#false} is VALID [2022-04-07 19:20:17,400 INFO L272 TraceCheckUtils]: 38: Hoare triple {12697#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {12697#false} is VALID [2022-04-07 19:20:17,400 INFO L290 TraceCheckUtils]: 37: Hoare triple {12697#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12697#false} is VALID [2022-04-07 19:20:17,400 INFO L290 TraceCheckUtils]: 36: Hoare triple {12697#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12697#false} is VALID [2022-04-07 19:20:17,400 INFO L290 TraceCheckUtils]: 35: Hoare triple {12697#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12697#false} is VALID [2022-04-07 19:20:17,400 INFO L290 TraceCheckUtils]: 34: Hoare triple {12697#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12697#false} is VALID [2022-04-07 19:20:17,400 INFO L290 TraceCheckUtils]: 33: Hoare triple {12697#false} [137] L41-3-->L41-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] {12697#false} is VALID [2022-04-07 19:20:17,400 INFO L290 TraceCheckUtils]: 32: Hoare triple {12697#false} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12697#false} is VALID [2022-04-07 19:20:17,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {12796#(<= |main_#t~post8| 4)} [154] L48-1-->L48-4: Formula: (not (< |v_main_#t~post8_3| 5)) InVars {main_#t~post8=|v_main_#t~post8_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {12697#false} is VALID [2022-04-07 19:20:17,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {12786#(<= ~counter~0 4)} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {12796#(<= |main_#t~post8| 4)} is VALID [2022-04-07 19:20:17,401 INFO L290 TraceCheckUtils]: 29: Hoare triple {12786#(<= ~counter~0 4)} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {12786#(<= ~counter~0 4)} is VALID [2022-04-07 19:20:17,401 INFO L290 TraceCheckUtils]: 28: Hoare triple {12786#(<= ~counter~0 4)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12786#(<= ~counter~0 4)} is VALID [2022-04-07 19:20:17,402 INFO L290 TraceCheckUtils]: 27: Hoare triple {12776#(<= ~counter~0 3)} [137] L41-3-->L41-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] {12786#(<= ~counter~0 4)} is VALID [2022-04-07 19:20:17,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {12776#(<= ~counter~0 3)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12776#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:17,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {12776#(<= ~counter~0 3)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12776#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:17,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {12763#(<= ~counter~0 2)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12776#(<= ~counter~0 3)} is VALID [2022-04-07 19:20:17,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {12763#(<= ~counter~0 2)} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12763#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:17,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {12763#(<= ~counter~0 2)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {12763#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:17,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {12763#(<= ~counter~0 2)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {12763#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:17,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {12753#(<= ~counter~0 1)} [137] L41-3-->L41-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] {12763#(<= ~counter~0 2)} is VALID [2022-04-07 19:20:17,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {12753#(<= ~counter~0 1)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {12753#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:17,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {12753#(<= ~counter~0 1)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {12753#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:17,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {12704#(<= ~counter~0 0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {12753#(<= ~counter~0 1)} is VALID [2022-04-07 19:20:17,406 INFO L290 TraceCheckUtils]: 16: Hoare triple {12704#(<= ~counter~0 0)} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,406 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12696#true} {12704#(<= ~counter~0 0)} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,406 INFO L290 TraceCheckUtils]: 14: Hoare triple {12696#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12696#true} is VALID [2022-04-07 19:20:17,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {12696#true} [122] 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[] {12696#true} is VALID [2022-04-07 19:20:17,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {12696#true} [119] 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] {12696#true} is VALID [2022-04-07 19:20:17,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {12704#(<= ~counter~0 0)} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {12696#true} is VALID [2022-04-07 19:20:17,407 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12696#true} {12704#(<= ~counter~0 0)} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,407 INFO L290 TraceCheckUtils]: 9: Hoare triple {12696#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12696#true} is VALID [2022-04-07 19:20:17,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {12696#true} [122] 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[] {12696#true} is VALID [2022-04-07 19:20:17,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {12696#true} [119] 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] {12696#true} is VALID [2022-04-07 19:20:17,408 INFO L272 TraceCheckUtils]: 6: Hoare triple {12704#(<= ~counter~0 0)} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {12696#true} is VALID [2022-04-07 19:20:17,408 INFO L290 TraceCheckUtils]: 5: Hoare triple {12704#(<= ~counter~0 0)} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,408 INFO L272 TraceCheckUtils]: 4: Hoare triple {12704#(<= ~counter~0 0)} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,409 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12704#(<= ~counter~0 0)} {12696#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {12704#(<= ~counter~0 0)} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,410 INFO L290 TraceCheckUtils]: 1: Hoare triple {12696#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {12704#(<= ~counter~0 0)} is VALID [2022-04-07 19:20:17,410 INFO L272 TraceCheckUtils]: 0: Hoare triple {12696#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {12696#true} is VALID [2022-04-07 19:20:17,410 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-07 19:20:17,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:17,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864110424] [2022-04-07 19:20:17,410 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:17,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518139313] [2022-04-07 19:20:17,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518139313] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:20:17,411 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:20:17,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-04-07 19:20:17,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178040940] [2022-04-07 19:20:17,411 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:20:17,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-07 19:20:17,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:17,412 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:17,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:17,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-07 19:20:17,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:17,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-07 19:20:17,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-07 19:20:17,440 INFO L87 Difference]: Start difference. First operand 498 states and 775 transitions. Second operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:17,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:17,676 INFO L93 Difference]: Finished difference Result 504 states and 778 transitions. [2022-04-07 19:20:17,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-07 19:20:17,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-04-07 19:20:17,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:17,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2022-04-07 19:20:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 101 transitions. [2022-04-07 19:20:17,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 101 transitions. [2022-04-07 19:20:17,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:17,783 INFO L225 Difference]: With dead ends: 504 [2022-04-07 19:20:17,784 INFO L226 Difference]: Without dead ends: 504 [2022-04-07 19:20:17,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-07 19:20:17,786 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 60 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:17,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 176 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:20:17,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-04-07 19:20:17,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 502. [2022-04-07 19:20:17,801 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:17,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 504 states. Second operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:17,802 INFO L74 IsIncluded]: Start isIncluded. First operand 504 states. Second operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:17,803 INFO L87 Difference]: Start difference. First operand 504 states. Second operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:17,860 INFO L93 Difference]: Finished difference Result 504 states and 778 transitions. [2022-04-07 19:20:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 778 transitions. [2022-04-07 19:20:17,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:17,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:17,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 504 states. [2022-04-07 19:20:17,864 INFO L87 Difference]: Start difference. First operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) Second operand 504 states. [2022-04-07 19:20:17,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:17,890 INFO L93 Difference]: Finished difference Result 504 states and 778 transitions. [2022-04-07 19:20:17,890 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 778 transitions. [2022-04-07 19:20:17,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:17,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:17,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:17,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 314 states have (on average 1.4044585987261147) internal successors, (441), 334 states have internal predecessors, (441), 169 states have call successors, (169), 19 states have call predecessors, (169), 18 states have return successors, (167), 148 states have call predecessors, (167), 167 states have call successors, (167) [2022-04-07 19:20:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 777 transitions. [2022-04-07 19:20:17,919 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 777 transitions. Word has length 42 [2022-04-07 19:20:17,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:17,919 INFO L478 AbstractCegarLoop]: Abstraction has 502 states and 777 transitions. [2022-04-07 19:20:17,920 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-07 19:20:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 777 transitions. [2022-04-07 19:20:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-07 19:20:17,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:17,921 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:20:17,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:18,149 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:18,150 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:18,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:18,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1867030118, now seen corresponding path program 2 times [2022-04-07 19:20:18,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:18,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771777226] [2022-04-07 19:20:18,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:18,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:18,165 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:18,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889531966] [2022-04-07 19:20:18,165 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-07 19:20:18,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:18,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:18,169 INFO L229 MonitoredProcess]: Starting monitored process 16 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:20:18,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-07 19:20:18,221 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-07 19:20:18,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-07 19:20:18,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-07 19:20:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:18,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:18,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {14973#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14973#true} is VALID [2022-04-07 19:20:18,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {14973#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {14973#true} is VALID [2022-04-07 19:20:18,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {14973#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14973#true} is VALID [2022-04-07 19:20:18,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14973#true} {14973#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14973#true} is VALID [2022-04-07 19:20:18,375 INFO L272 TraceCheckUtils]: 4: Hoare triple {14973#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14973#true} is VALID [2022-04-07 19:20:18,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {14973#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L272 TraceCheckUtils]: 6: Hoare triple {14973#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {14973#true} [119] 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] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {14973#true} [122] 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[] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {14973#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14973#true} {14973#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L272 TraceCheckUtils]: 11: Hoare triple {14973#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L290 TraceCheckUtils]: 12: Hoare triple {14973#true} [119] 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] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L290 TraceCheckUtils]: 13: Hoare triple {14973#true} [122] 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[] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {14973#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14973#true} {14973#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {14973#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {14973#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {14973#true} is VALID [2022-04-07 19:20:18,376 INFO L290 TraceCheckUtils]: 18: Hoare triple {14973#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {14973#true} is VALID [2022-04-07 19:20:18,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {14973#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {14973#true} is VALID [2022-04-07 19:20:18,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {14973#true} [137] L41-3-->L41-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] {14973#true} is VALID [2022-04-07 19:20:18,377 INFO L290 TraceCheckUtils]: 21: Hoare triple {14973#true} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {14973#true} is VALID [2022-04-07 19:20:18,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {14973#true} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {15044#(not (<= main_~b~0 main_~c~0))} is VALID [2022-04-07 19:20:18,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {15044#(not (<= main_~b~0 main_~c~0))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {15048#(< main_~b~0 main_~a~0)} is VALID [2022-04-07 19:20:18,378 INFO L290 TraceCheckUtils]: 24: Hoare triple {15048#(< main_~b~0 main_~a~0)} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {15048#(< main_~b~0 main_~a~0)} is VALID [2022-04-07 19:20:18,378 INFO L290 TraceCheckUtils]: 25: Hoare triple {15048#(< main_~b~0 main_~a~0)} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {15048#(< main_~b~0 main_~a~0)} is VALID [2022-04-07 19:20:18,379 INFO L290 TraceCheckUtils]: 26: Hoare triple {15048#(< main_~b~0 main_~a~0)} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {15058#(< main_~b~0 main_~c~0)} is VALID [2022-04-07 19:20:18,379 INFO L290 TraceCheckUtils]: 27: Hoare triple {15058#(< main_~b~0 main_~c~0)} [137] L41-3-->L41-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] {15058#(< main_~b~0 main_~c~0)} is VALID [2022-04-07 19:20:18,379 INFO L290 TraceCheckUtils]: 28: Hoare triple {15058#(< main_~b~0 main_~c~0)} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {15058#(< main_~b~0 main_~c~0)} is VALID [2022-04-07 19:20:18,380 INFO L290 TraceCheckUtils]: 29: Hoare triple {15058#(< main_~b~0 main_~c~0)} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {14974#false} is VALID [2022-04-07 19:20:18,380 INFO L290 TraceCheckUtils]: 30: Hoare triple {14974#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {14974#false} is VALID [2022-04-07 19:20:18,380 INFO L290 TraceCheckUtils]: 31: Hoare triple {14974#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {14974#false} is VALID [2022-04-07 19:20:18,380 INFO L290 TraceCheckUtils]: 32: Hoare triple {14974#false} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {14974#false} is VALID [2022-04-07 19:20:18,380 INFO L290 TraceCheckUtils]: 33: Hoare triple {14974#false} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {14974#false} is VALID [2022-04-07 19:20:18,380 INFO L290 TraceCheckUtils]: 34: Hoare triple {14974#false} [137] L41-3-->L41-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] {14974#false} is VALID [2022-04-07 19:20:18,381 INFO L290 TraceCheckUtils]: 35: Hoare triple {14974#false} [142] L41-1-->L41-4: Formula: (not (< |v_main_#t~post7_3| 5)) InVars {main_#t~post7=|v_main_#t~post7_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {14974#false} is VALID [2022-04-07 19:20:18,381 INFO L290 TraceCheckUtils]: 36: Hoare triple {14974#false} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {14974#false} is VALID [2022-04-07 19:20:18,381 INFO L290 TraceCheckUtils]: 37: Hoare triple {14974#false} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {14974#false} is VALID [2022-04-07 19:20:18,381 INFO L290 TraceCheckUtils]: 38: Hoare triple {14974#false} [127] L34-1-->L34-4: Formula: (not (< |v_main_#t~post6_3| 5)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {14974#false} is VALID [2022-04-07 19:20:18,381 INFO L272 TraceCheckUtils]: 39: Hoare triple {14974#false} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {14974#false} is VALID [2022-04-07 19:20:18,381 INFO L290 TraceCheckUtils]: 40: Hoare triple {14974#false} [130] __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] {14974#false} is VALID [2022-04-07 19:20:18,381 INFO L290 TraceCheckUtils]: 41: Hoare triple {14974#false} [134] 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[] {14974#false} is VALID [2022-04-07 19:20:18,381 INFO L290 TraceCheckUtils]: 42: Hoare triple {14974#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {14974#false} is VALID [2022-04-07 19:20:18,382 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-04-07 19:20:18,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-07 19:20:18,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:20:18,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771777226] [2022-04-07 19:20:18,382 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:20:18,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889531966] [2022-04-07 19:20:18,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889531966] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-07 19:20:18,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-07 19:20:18,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-07 19:20:18,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717500318] [2022-04-07 19:20:18,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-07 19:20:18,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-04-07 19:20:18,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:20:18,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:18,415 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:18,415 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-07 19:20:18,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:20:18,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-07 19:20:18,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-07 19:20:18,415 INFO L87 Difference]: Start difference. First operand 502 states and 777 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:18,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:18,719 INFO L93 Difference]: Finished difference Result 760 states and 1199 transitions. [2022-04-07 19:20:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-07 19:20:18,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2022-04-07 19:20:18,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:20:18,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:18,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-04-07 19:20:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2022-04-07 19:20:18,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2022-04-07 19:20:18,803 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:20:18,834 INFO L225 Difference]: With dead ends: 760 [2022-04-07 19:20:18,834 INFO L226 Difference]: Without dead ends: 760 [2022-04-07 19:20:18,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-04-07 19:20:18,835 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 29 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-07 19:20:18,835 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 173 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-07 19:20:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-04-07 19:20:18,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 523. [2022-04-07 19:20:18,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:20:18,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 760 states. Second operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-07 19:20:18,856 INFO L74 IsIncluded]: Start isIncluded. First operand 760 states. Second operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-07 19:20:18,856 INFO L87 Difference]: Start difference. First operand 760 states. Second operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-07 19:20:18,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:18,908 INFO L93 Difference]: Finished difference Result 760 states and 1199 transitions. [2022-04-07 19:20:18,908 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1199 transitions. [2022-04-07 19:20:18,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:18,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:18,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) Second operand 760 states. [2022-04-07 19:20:18,914 INFO L87 Difference]: Start difference. First operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) Second operand 760 states. [2022-04-07 19:20:18,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:20:18,983 INFO L93 Difference]: Finished difference Result 760 states and 1199 transitions. [2022-04-07 19:20:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 760 states and 1199 transitions. [2022-04-07 19:20:18,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:20:18,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:20:18,986 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:20:18,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:20:18,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 351 states have (on average 1.396011396011396) internal successors, (490), 369 states have internal predecessors, (490), 153 states have call successors, (153), 19 states have call predecessors, (153), 18 states have return successors, (151), 134 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-07 19:20:19,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 794 transitions. [2022-04-07 19:20:19,015 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 794 transitions. Word has length 43 [2022-04-07 19:20:19,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:20:19,015 INFO L478 AbstractCegarLoop]: Abstraction has 523 states and 794 transitions. [2022-04-07 19:20:19,015 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-07 19:20:19,015 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 794 transitions. [2022-04-07 19:20:19,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-07 19:20:19,016 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:20:19,016 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2022-04-07 19:20:19,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-07 19:20:19,239 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-07 19:20:19,239 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:20:19,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:20:19,240 INFO L85 PathProgramCache]: Analyzing trace with hash -2059301326, now seen corresponding path program 1 times [2022-04-07 19:20:19,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:20:19,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664852332] [2022-04-07 19:20:19,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:19,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:20:19,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:20:19,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [226636798] [2022-04-07 19:20:19,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:20:19,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:20:19,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:20:19,268 INFO L229 MonitoredProcess]: Starting monitored process 17 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:20:19,294 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-07 19:20:19,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:19,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-07 19:20:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-07 19:20:19,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-07 19:20:20,214 INFO L272 TraceCheckUtils]: 0: Hoare triple {17914#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:20:20,214 INFO L290 TraceCheckUtils]: 1: Hoare triple {17914#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {17914#true} is VALID [2022-04-07 19:20:20,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {17914#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:20:20,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17914#true} {17914#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:20:20,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {17914#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:20:20,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {17914#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17914#true} is VALID [2022-04-07 19:20:20,214 INFO L272 TraceCheckUtils]: 6: Hoare triple {17914#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {17914#true} is VALID [2022-04-07 19:20:20,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {17914#true} [119] 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] {17914#true} is VALID [2022-04-07 19:20:20,215 INFO L290 TraceCheckUtils]: 8: Hoare triple {17914#true} [122] 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[] {17914#true} is VALID [2022-04-07 19:20:20,215 INFO L290 TraceCheckUtils]: 9: Hoare triple {17914#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:20:20,215 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17914#true} {17914#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {17914#true} is VALID [2022-04-07 19:20:20,215 INFO L272 TraceCheckUtils]: 11: Hoare triple {17914#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {17914#true} is VALID [2022-04-07 19:20:20,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {17914#true} [119] 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] {17914#true} is VALID [2022-04-07 19:20:20,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {17914#true} [122] 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[] {17914#true} is VALID [2022-04-07 19:20:20,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {17914#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:20:20,215 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17914#true} {17914#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {17914#true} is VALID [2022-04-07 19:20:20,215 INFO L290 TraceCheckUtils]: 16: Hoare triple {17914#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17967#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {17967#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {17967#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {17967#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {17967#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {17967#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {17977#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {17977#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [137] L41-3-->L41-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] {17977#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {17977#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {17977#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {17977#(and (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {17987#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {17987#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {17987#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {17987#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {17987#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,219 INFO L272 TraceCheckUtils]: 25: Hoare triple {17987#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {17914#true} is VALID [2022-04-07 19:20:20,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {17914#true} [130] __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] {18000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:20,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {18000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] 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[] {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:20,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:20,221 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} {17987#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~c~0 main_~a~0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,221 INFO L272 TraceCheckUtils]: 30: Hoare triple {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {17914#true} is VALID [2022-04-07 19:20:20,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {17914#true} [130] __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] {18000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:20,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {18000#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [135] 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[] {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:20,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:20:20,223 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,223 INFO L272 TraceCheckUtils]: 35: Hoare triple {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {17914#true} is VALID [2022-04-07 19:20:20,223 INFO L290 TraceCheckUtils]: 36: Hoare triple {17914#true} [130] __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] {17914#true} is VALID [2022-04-07 19:20:20,223 INFO L290 TraceCheckUtils]: 37: Hoare triple {17914#true} [135] 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[] {17914#true} is VALID [2022-04-07 19:20:20,223 INFO L290 TraceCheckUtils]: 38: Hoare triple {17914#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:20:20,224 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17914#true} {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,224 INFO L272 TraceCheckUtils]: 40: Hoare triple {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {17914#true} is VALID [2022-04-07 19:20:20,224 INFO L290 TraceCheckUtils]: 41: Hoare triple {17914#true} [130] __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] {17914#true} is VALID [2022-04-07 19:20:20,224 INFO L290 TraceCheckUtils]: 42: Hoare triple {17914#true} [135] 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[] {17914#true} is VALID [2022-04-07 19:20:20,224 INFO L290 TraceCheckUtils]: 43: Hoare triple {17914#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:20:20,225 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17914#true} {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,225 INFO L290 TraceCheckUtils]: 45: Hoare triple {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,226 INFO L290 TraceCheckUtils]: 46: Hoare triple {18011#(and (= main_~b~0 main_~v~0) (= main_~r~0 0) (= main_~k~0 0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~d~0 1) (= main_~q~0 0) (= main_~c~0 main_~x~0) (= main_~p~0 1))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {18063#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,226 INFO L290 TraceCheckUtils]: 47: Hoare triple {18063#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [137] L41-3-->L41-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] {18063#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,227 INFO L290 TraceCheckUtils]: 48: Hoare triple {18063#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {18063#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,227 INFO L290 TraceCheckUtils]: 49: Hoare triple {18063#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {18063#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-07 19:20:20,228 INFO L290 TraceCheckUtils]: 50: Hoare triple {18063#(and (= main_~r~0 0) (= main_~x~0 (+ main_~c~0 main_~b~0)) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~k~0 1) (= main_~q~0 0) (= main_~p~0 1))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {18076#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:20,228 INFO L290 TraceCheckUtils]: 51: Hoare triple {18076#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {18076#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:20,229 INFO L290 TraceCheckUtils]: 52: Hoare triple {18076#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {18076#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:20,229 INFO L290 TraceCheckUtils]: 53: Hoare triple {18076#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= (+ main_~x~0 (* (- 1) main_~y~0)) main_~b~0) (= main_~r~0 1) (= main_~a~0 main_~y~0))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {18086#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} is VALID [2022-04-07 19:20:20,230 INFO L272 TraceCheckUtils]: 54: Hoare triple {18086#(and (= (+ main_~s~0 main_~r~0) 0) (= (+ main_~q~0 main_~p~0) 1) (= main_~p~0 0) (= main_~r~0 1) (= (+ main_~x~0 (* (- 1) main_~y~0)) 0) (= main_~a~0 main_~y~0))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {18090#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:20:20,230 INFO L290 TraceCheckUtils]: 55: Hoare triple {18090#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {18094#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:20:20,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {18094#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {17915#false} is VALID [2022-04-07 19:20:20,231 INFO L290 TraceCheckUtils]: 57: Hoare triple {17915#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17915#false} is VALID [2022-04-07 19:20:20,231 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 19:20:20,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-07 19:21:07,459 INFO L290 TraceCheckUtils]: 57: Hoare triple {17915#false} [138] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17915#false} is VALID [2022-04-07 19:21:07,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {18094#(<= 1 __VERIFIER_assert_~cond)} [134] 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[] {17915#false} is VALID [2022-04-07 19:21:07,460 INFO L290 TraceCheckUtils]: 55: Hoare triple {18090#(<= 1 |__VERIFIER_assert_#in~cond|)} [130] __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] {18094#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-07 19:21:07,462 INFO L272 TraceCheckUtils]: 54: Hoare triple {18110#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [126] L34-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~y~0_12 v_main_~r~0_8) (* (- 1) (* v_main_~y~0_12 v_main_~s~0_8)) (* (- 1) (* v_main_~x~0_12 v_main_~q~0_8)) (* v_main_~x~0_12 v_main_~p~0_8)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_5|) InVars {main_~q~0=v_main_~q~0_8, main_~x~0=v_main_~x~0_12, main_~y~0=v_main_~y~0_12, main_~p~0=v_main_~p~0_8, main_~r~0=v_main_~r~0_8, main_~s~0=v_main_~s~0_8, main_~a~0=v_main_~a~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_~p~0, main_~r~0, main_~s~0, main_~a~0] {18090#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-07 19:21:07,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {18114#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [131] L35-->L34-4: Formula: (= v_main_~b~0_5 0) InVars {main_~b~0=v_main_~b~0_5} OutVars{main_~b~0=v_main_~b~0_5} AuxVars[] AssignedVars[] {18110#(= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-07 19:21:07,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {18114#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {18114#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-07 19:21:07,463 INFO L290 TraceCheckUtils]: 51: Hoare triple {18114#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {18114#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-07 19:21:07,551 INFO L290 TraceCheckUtils]: 50: Hoare triple {18124#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [141] L41-4-->L34-3: Formula: (and (= v_main_~r~0_1 v_main_~s~0_2) (= v_main_~b~0_1 v_main_~c~0_3) (= v_main_~p~0_2 (+ v_main_~q~0_1 (* v_main_~k~0_3 v_main_~q~0_2))) (= v_main_~r~0_2 v_main_~temp~0_1) (= v_main_~p~0_1 v_main_~q~0_2) (= v_main_~a~0_1 v_main_~b~0_2) (= v_main_~s~0_1 (+ v_main_~temp~0_1 (* (- 1) (* v_main_~k~0_3 v_main_~s~0_2))))) InVars {main_~q~0=v_main_~q~0_2, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_2} OutVars{main_~q~0=v_main_~q~0_1, main_~temp~0=v_main_~temp~0_1, main_~k~0=v_main_~k~0_3, main_~c~0=v_main_~c~0_3, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_1, main_~r~0=v_main_~r~0_1, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_~q~0, main_~temp~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {18114#(or (= (+ (* main_~q~0 main_~x~0) main_~a~0 (* main_~y~0 main_~s~0)) (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0))) (not (= main_~b~0 0)))} is VALID [2022-04-07 19:21:07,551 INFO L290 TraceCheckUtils]: 49: Hoare triple {18124#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [144] L42-->L41-4: Formula: (not (<= v_main_~b~0_7 v_main_~c~0_6)) InVars {main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} OutVars{main_~b~0=v_main_~b~0_7, main_~c~0=v_main_~c~0_6} AuxVars[] AssignedVars[] {18124#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,552 INFO L290 TraceCheckUtils]: 48: Hoare triple {18124#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {18124#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,552 INFO L290 TraceCheckUtils]: 47: Hoare triple {18124#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [137] L41-3-->L41-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] {18124#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,583 INFO L290 TraceCheckUtils]: 46: Hoare triple {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [153] L48-4-->L41-3: Formula: (and (= v_main_~k~0_1 (+ v_main_~d~0_1 v_main_~k~0_2)) (= (+ v_main_~c~0_2 (* (- 1) v_main_~v~0_1)) v_main_~c~0_1)) InVars {main_~c~0=v_main_~c~0_2, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_2} OutVars{main_~c~0=v_main_~c~0_1, main_~v~0=v_main_~v~0_1, main_~d~0=v_main_~d~0_1, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {18124#(or (not (= main_~c~0 0)) (= (+ (* (+ (* (* main_~k~0 main_~s~0) (- 1)) main_~r~0) main_~y~0) main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 main_~k~0)) main_~x~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,584 INFO L290 TraceCheckUtils]: 45: Hoare triple {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [149] L52-->L48-4: Formula: (not (<= (* v_main_~v~0_5 2) v_main_~c~0_9)) InVars {main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} OutVars{main_~c~0=v_main_~c~0_9, main_~v~0=v_main_~v~0_5} AuxVars[] AssignedVars[] {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,585 INFO L284 TraceCheckUtils]: 44: Hoare quadruple {17914#true} {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [164] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {17914#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:21:07,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {17914#true} [135] 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[] {17914#true} is VALID [2022-04-07 19:21:07,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {17914#true} [130] __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] {17914#true} is VALID [2022-04-07 19:21:07,585 INFO L272 TraceCheckUtils]: 40: Hoare triple {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [148] L51-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= v_main_~v~0_8 (* v_main_~d~0_7 v_main_~b~0_14)) 1 0)) InVars {main_~v~0=v_main_~v~0_8, main_~d~0=v_main_~d~0_7, main_~b~0=v_main_~b~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~d~0, main_~b~0] {17914#true} is VALID [2022-04-07 19:21:07,586 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17914#true} {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [163] __VERIFIER_assertEXIT-->L51: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {17914#true} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:21:07,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {17914#true} [135] 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[] {17914#true} is VALID [2022-04-07 19:21:07,586 INFO L290 TraceCheckUtils]: 36: Hoare triple {17914#true} [130] __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] {17914#true} is VALID [2022-04-07 19:21:07,586 INFO L272 TraceCheckUtils]: 35: Hoare triple {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [147] L50-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~a~0_9 (+ (* v_main_~k~0_7 v_main_~b~0_13) v_main_~c~0_11)) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~c~0=v_main_~c~0_11, main_~b~0=v_main_~b~0_13, main_~k~0=v_main_~k~0_7, main_~a~0=v_main_~a~0_9} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~k~0, main_~c~0, main_~b~0, main_~a~0] {17914#true} is VALID [2022-04-07 19:21:07,587 INFO L284 TraceCheckUtils]: 34: Hoare quadruple {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} {18174#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [162] __VERIFIER_assertEXIT-->L50: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {18137#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,588 INFO L290 TraceCheckUtils]: 33: Hoare triple {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:21:07,588 INFO L290 TraceCheckUtils]: 32: Hoare triple {18184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] 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[] {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:21:07,588 INFO L290 TraceCheckUtils]: 31: Hoare triple {17914#true} [130] __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] {18184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:21:07,588 INFO L272 TraceCheckUtils]: 30: Hoare triple {18174#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [146] L49-1-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (+ (* v_main_~x~0_11 v_main_~q~0_7) (* v_main_~y~0_11 v_main_~s~0_7)) v_main_~b~0_12) 1 0)) InVars {main_~q~0=v_main_~q~0_7, main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_7} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {17914#true} is VALID [2022-04-07 19:21:07,589 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} {18191#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [161] __VERIFIER_assertEXIT-->L49-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {18174#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,590 INFO L290 TraceCheckUtils]: 28: Hoare triple {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} [140] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:21:07,590 INFO L290 TraceCheckUtils]: 27: Hoare triple {18184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [135] 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[] {18004#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-07 19:21:07,590 INFO L290 TraceCheckUtils]: 26: Hoare triple {17914#true} [130] __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] {18184#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-07 19:21:07,590 INFO L272 TraceCheckUtils]: 25: Hoare triple {18191#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [156] L49-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= v_main_~a~0_8 (+ (* v_main_~x~0_10 v_main_~p~0_7) (* v_main_~y~0_10 v_main_~r~0_7))) 1 0)) InVars {main_~y~0=v_main_~y~0_10, main_~x~0=v_main_~x~0_10, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~a~0=v_main_~a~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {17914#true} is VALID [2022-04-07 19:21:07,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {18191#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [155] L48-1-->L49: Formula: (< |v_main_#t~post8_5| 5) InVars {main_#t~post8=|v_main_#t~post8_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post8] {18191#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,592 INFO L290 TraceCheckUtils]: 23: Hoare triple {18191#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} [152] L48-3-->L48-1: Formula: (and (= (+ |v_main_#t~post8_1| 1) v_~counter~0_5) (= |v_main_#t~post8_1| v_~counter~0_6)) InVars {~counter~0=v_~counter~0_6} OutVars{main_#t~post8=|v_main_#t~post8_1|, ~counter~0=v_~counter~0_5} AuxVars[] AssignedVars[~counter~0, main_#t~post8] {18191#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,594 INFO L290 TraceCheckUtils]: 22: Hoare triple {18213#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [145] L42-->L48-3: Formula: (and (= v_main_~d~0_2 1) (<= v_main_~b~0_8 v_main_~c~0_7) (= v_main_~b~0_8 v_main_~v~0_2)) InVars {main_~b~0=v_main_~b~0_8, main_~c~0=v_main_~c~0_7} OutVars{main_~c~0=v_main_~c~0_7, main_~v~0=v_main_~v~0_2, main_~d~0=v_main_~d~0_2, main_~b~0=v_main_~b~0_8} AuxVars[] AssignedVars[main_~v~0, main_~d~0] {18191#(or (not (= (+ main_~c~0 (* (- 1) main_~v~0)) 0)) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (= (+ main_~b~0 (* (+ main_~p~0 (* (- 1) main_~q~0 (+ main_~d~0 main_~k~0))) main_~x~0) (* (+ (* (- 1) (* main_~s~0 (+ main_~d~0 main_~k~0))) main_~r~0) main_~y~0)) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))))} is VALID [2022-04-07 19:21:07,594 INFO L290 TraceCheckUtils]: 21: Hoare triple {18213#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [143] L41-1-->L42: Formula: (< |v_main_#t~post7_5| 5) InVars {main_#t~post7=|v_main_#t~post7_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post7] {18213#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-07 19:21:07,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {18213#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} [137] L41-3-->L41-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] {18213#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-07 19:21:07,596 INFO L290 TraceCheckUtils]: 19: Hoare triple {17914#true} [132] L35-->L41-3: Formula: (and (not (= v_main_~b~0_6 0)) (= v_main_~k~0_4 0) (= v_main_~a~0_5 v_main_~c~0_4)) InVars {main_~b~0=v_main_~b~0_6, main_~a~0=v_main_~a~0_5} OutVars{main_~c~0=v_main_~c~0_4, main_~b~0=v_main_~b~0_6, main_~k~0=v_main_~k~0_4, main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[main_~k~0, main_~c~0] {18213#(or (= (+ (* main_~x~0 (+ main_~p~0 (* (- 1) (+ main_~k~0 1) main_~q~0))) main_~b~0 (* main_~y~0 (+ main_~r~0 (* (* (+ main_~k~0 1) main_~s~0) (- 1))))) (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0))) (not (= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))) (not (= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))) (not (= main_~c~0 main_~b~0)))} is VALID [2022-04-07 19:21:07,596 INFO L290 TraceCheckUtils]: 18: Hoare triple {17914#true} [128] L34-1-->L35: Formula: (< |v_main_#t~post6_5| 5) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L290 TraceCheckUtils]: 17: Hoare triple {17914#true} [124] L34-3-->L34-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {17914#true} [120] L25-->L34-3: Formula: (and (= v_main_~b~0_4 v_main_~y~0_6) (= v_main_~q~0_5 0) (= v_main_~s~0_5 1) (= v_main_~p~0_5 1) (= v_main_~a~0_4 v_main_~x~0_6) (= v_main_~r~0_5 0)) InVars {main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6} OutVars{main_~q~0=v_main_~q~0_5, main_~x~0=v_main_~x~0_6, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_4, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_5, main_~a~0=v_main_~a~0_4} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17914#true} {17914#true} [159] 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_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L290 TraceCheckUtils]: 14: Hoare triple {17914#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L290 TraceCheckUtils]: 13: Hoare triple {17914#true} [122] 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[] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L290 TraceCheckUtils]: 12: Hoare triple {17914#true} [119] 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] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L272 TraceCheckUtils]: 11: Hoare triple {17914#true} [118] L24-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 v_main_~y~0_9) 1 0)) InVars {main_~y~0=v_main_~y~0_9} 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] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17914#true} {17914#true} [158] assume_abort_if_notEXIT-->L24-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L290 TraceCheckUtils]: 9: Hoare triple {17914#true} [125] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:21:07,596 INFO L290 TraceCheckUtils]: 8: Hoare triple {17914#true} [122] 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[] {17914#true} is VALID [2022-04-07 19:21:07,597 INFO L290 TraceCheckUtils]: 7: Hoare triple {17914#true} [119] 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] {17914#true} is VALID [2022-04-07 19:21:07,597 INFO L272 TraceCheckUtils]: 6: Hoare triple {17914#true} [117] L24-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_9) 1 0)) InVars {main_~x~0=v_main_~x~0_9} 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] {17914#true} is VALID [2022-04-07 19:21:07,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {17914#true} [115] 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_3, main_~x~0=v_main_~x~0_1, main_~y~0=v_main_~y~0_1, main_~b~0=v_main_~b~0_3, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_3, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~q~0, main_#t~nondet4, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {17914#true} is VALID [2022-04-07 19:21:07,597 INFO L272 TraceCheckUtils]: 4: Hoare triple {17914#true} [112] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:21:07,597 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17914#true} {17914#true} [157] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:21:07,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {17914#true} [116] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:21:07,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {17914#true} [113] 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) (= v_~counter~0_7 0) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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] {17914#true} is VALID [2022-04-07 19:21:07,597 INFO L272 TraceCheckUtils]: 0: Hoare triple {17914#true} [111] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {17914#true} is VALID [2022-04-07 19:21:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-07 19:21:07,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-07 19:21:07,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664852332] [2022-04-07 19:21:07,598 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-07 19:21:07,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226636798] [2022-04-07 19:21:07,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226636798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-07 19:21:07,598 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-07 19:21:07,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2022-04-07 19:21:07,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141774220] [2022-04-07 19:21:07,598 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-07 19:21:07,599 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-07 19:21:07,599 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-07 19:21:07,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:21:07,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-07 19:21:07,746 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-07 19:21:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-07 19:21:07,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-07 19:21:07,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2022-04-07 19:21:07,746 INFO L87 Difference]: Start difference. First operand 523 states and 794 transitions. Second operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:21:20,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:21:20,604 INFO L93 Difference]: Finished difference Result 836 states and 1287 transitions. [2022-04-07 19:21:20,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-07 19:21:20,605 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 58 [2022-04-07 19:21:20,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-07 19:21:20,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:21:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 313 transitions. [2022-04-07 19:21:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:21:20,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 313 transitions. [2022-04-07 19:21:20,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 313 transitions. [2022-04-07 19:21:28,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 312 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-07 19:21:28,315 INFO L225 Difference]: With dead ends: 836 [2022-04-07 19:21:28,315 INFO L226 Difference]: Without dead ends: 834 [2022-04-07 19:21:28,316 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2022-04-07 19:21:28,316 INFO L913 BasicCegarLoop]: 56 mSDtfsCounter, 177 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 1241 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-04-07 19:21:28,317 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 579 Invalid, 1506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1241 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-04-07 19:21:28,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2022-04-07 19:21:28,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 673. [2022-04-07 19:21:28,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-07 19:21:28,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 834 states. Second operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-07 19:21:28,338 INFO L74 IsIncluded]: Start isIncluded. First operand 834 states. Second operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-07 19:21:28,339 INFO L87 Difference]: Start difference. First operand 834 states. Second operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-07 19:21:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:21:28,396 INFO L93 Difference]: Finished difference Result 834 states and 1273 transitions. [2022-04-07 19:21:28,396 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1273 transitions. [2022-04-07 19:21:28,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:21:28,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:21:28,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) Second operand 834 states. [2022-04-07 19:21:28,402 INFO L87 Difference]: Start difference. First operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) Second operand 834 states. [2022-04-07 19:21:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-07 19:21:28,454 INFO L93 Difference]: Finished difference Result 834 states and 1273 transitions. [2022-04-07 19:21:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 1273 transitions. [2022-04-07 19:21:28,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-07 19:21:28,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-07 19:21:28,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-07 19:21:28,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-07 19:21:28,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 474 states have (on average 1.40084388185654) internal successors, (664), 486 states have internal predecessors, (664), 177 states have call successors, (177), 22 states have call predecessors, (177), 21 states have return successors, (175), 164 states have call predecessors, (175), 175 states have call successors, (175) [2022-04-07 19:21:28,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1016 transitions. [2022-04-07 19:21:28,489 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1016 transitions. Word has length 58 [2022-04-07 19:21:28,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-07 19:21:28,489 INFO L478 AbstractCegarLoop]: Abstraction has 673 states and 1016 transitions. [2022-04-07 19:21:28,489 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 8 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-04-07 19:21:28,489 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1016 transitions. [2022-04-07 19:21:28,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-07 19:21:28,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-07 19:21:28,490 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2022-04-07 19:21:28,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-07 19:21:28,703 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-07 19:21:28,703 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-07 19:21:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-07 19:21:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash -80402644, now seen corresponding path program 1 times [2022-04-07 19:21:28,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-07 19:21:28,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81160065] [2022-04-07 19:21:28,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:21:28,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-07 19:21:28,723 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-07 19:21:28,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [220232808] [2022-04-07 19:21:28,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-07 19:21:28,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-07 19:21:28,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-07 19:21:28,729 INFO L229 MonitoredProcess]: Starting monitored process 18 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:21:28,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-07 19:21:28,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:21:28,794 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-07 19:21:28,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-07 19:21:28,877 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-07 19:21:28,877 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-07 19:21:28,878 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-07 19:21:28,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-07 19:21:29,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-07 19:21:29,090 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-07 19:21:29,091 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-07 19:21:29,144 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.04 07:21:29 BasicIcfg [2022-04-07 19:21:29,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-07 19:21:29,145 INFO L158 Benchmark]: Toolchain (without parser) took 92038.56ms. Allocated memory was 174.1MB in the beginning and 295.7MB in the end (delta: 121.6MB). Free memory was 127.3MB in the beginning and 104.4MB in the end (delta: 22.9MB). Peak memory consumption was 145.2MB. Max. memory is 8.0GB. [2022-04-07 19:21:29,146 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 174.1MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-07 19:21:29,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.00ms. Allocated memory is still 174.1MB. Free memory was 127.1MB in the beginning and 151.9MB in the end (delta: -24.9MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-07 19:21:29,146 INFO L158 Benchmark]: Boogie Preprocessor took 36.42ms. Allocated memory is still 174.1MB. Free memory was 151.9MB in the beginning and 150.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:21:29,146 INFO L158 Benchmark]: RCFGBuilder took 432.13ms. Allocated memory is still 174.1MB. Free memory was 150.1MB in the beginning and 137.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-07 19:21:29,147 INFO L158 Benchmark]: IcfgTransformer took 56.37ms. Allocated memory is still 174.1MB. Free memory was 137.2MB in the beginning and 135.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-07 19:21:29,147 INFO L158 Benchmark]: TraceAbstraction took 91221.12ms. Allocated memory was 174.1MB in the beginning and 295.7MB in the end (delta: 121.6MB). Free memory was 134.8MB in the beginning and 104.4MB in the end (delta: 30.4MB). Peak memory consumption was 152.4MB. Max. memory is 8.0GB. [2022-04-07 19:21:29,148 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.12ms. Allocated memory is still 174.1MB. Free memory is still 143.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 286.00ms. Allocated memory is still 174.1MB. Free memory was 127.1MB in the beginning and 151.9MB in the end (delta: -24.9MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 36.42ms. Allocated memory is still 174.1MB. Free memory was 151.9MB in the beginning and 150.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 432.13ms. Allocated memory is still 174.1MB. Free memory was 150.1MB in the beginning and 137.2MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 56.37ms. Allocated memory is still 174.1MB. Free memory was 137.2MB in the beginning and 135.4MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 91221.12ms. Allocated memory was 174.1MB in the beginning and 295.7MB in the end (delta: 121.6MB). Free memory was 134.8MB in the beginning and 104.4MB in the end (delta: 30.4MB). Peak memory consumption was 152.4MB. 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)=10, counter=0] [L20] int x, y; [L21] long long a, b, p, q, r, s; [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=2, y=3] [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=2, y=3] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [\old(counter)=0, a=2, b=3, counter=0, p=1, q=0, r=0, s=1, x=2, y=3] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=3, counter=1, counter++=0, p=1, q=0, r=0, s=1, x=2, y=3] [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=2, b=3, c=2, counter=1, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L41] EXPR counter++ VAL [\old(counter)=0, a=2, b=3, c=2, counter=2, counter++=1, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L41] COND TRUE counter++<5 [L42] COND TRUE !(c >= b) VAL [\old(counter)=0, a=2, b=3, c=2, counter=2, k=0, p=1, q=0, r=0, s=1, x=2, y=3] [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=3, b=2, c=2, counter=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L34] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=2, counter=3, counter++=2, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L34] COND TRUE counter++<5 [L35] COND FALSE !(!(b != 0)) [L37] long long c, k; [L38] c = a [L39] k = 0 VAL [\old(counter)=0, a=3, b=2, c=3, counter=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=4, counter++=3, k=0, p=0, q=1, r=1, s=0, temp=0, x=2, y=3] [L41] COND TRUE counter++<5 [L42] COND FALSE !(!(c >= b)) [L44] long long d, v; [L45] d = 1 [L46] v = b VAL [\old(counter)=0, a=3, b=2, c=3, counter=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L48] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, counter++=4, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L48] COND TRUE counter++<5 [L49] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L49] RET __VERIFIER_assert(a == y * r + x * p) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L50] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L50] RET __VERIFIER_assert(b == x * q + y * s) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L51] CALL __VERIFIER_assert(a == k * b + c) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L51] RET __VERIFIER_assert(a == k * b + c) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L52] CALL __VERIFIER_assert(v == b * d) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L52] RET __VERIFIER_assert(v == b * d) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L54] COND TRUE !(c >= 2 * v) VAL [\old(counter)=0, a=3, b=2, c=3, counter=5, d=1, k=0, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L59] c = c - v [L60] k = k + d VAL [\old(counter)=0, a=3, b=2, c=1, counter=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L41] EXPR counter++ VAL [\old(counter)=0, a=3, b=2, c=1, counter=6, counter++=5, d=1, k=1, p=0, q=1, r=1, s=0, temp=0, v=2, x=2, y=3] [L41] COND FALSE !(counter++<5) [L63] a = b [L64] b = c [L65] long long temp; [L66] temp = p [L67] p = q [L68] q = temp - q * k [L69] temp = r [L70] r = s [L71] s = temp - s * k VAL [\old(counter)=0, a=2, b=1, c=1, counter=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=2, y=3] [L34] EXPR counter++ VAL [\old(counter)=0, a=2, b=1, c=1, counter=7, counter++=6, d=1, k=1, p=1, q=-1, r=0, s=1, temp=1, v=2, x=2, y=3] [L34] COND FALSE !(counter++<5) [L73] CALL __VERIFIER_assert(p*x - q*x + r*y - s*y == a) VAL [\old(cond)=0, \old(counter)=0, counter=7] [L11] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=7] [L13] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=7] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 40 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 91.1s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1081 SdHoareTripleChecker+Valid, 8.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1024 mSDsluCounter, 3688 SdHoareTripleChecker+Invalid, 8.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2837 mSDsCounter, 649 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2712 IncrementalHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 649 mSolverCounterUnsat, 851 mSDtfsCounter, 2712 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 914 GetRequests, 747 SyntacticMatches, 7 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 411 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=673occurred in iteration=17, InterpolantAutomatonStates: 154, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 17 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 55.2s InterpolantComputationTime, 666 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 859 ConstructedInterpolants, 0 QuantifiedInterpolants, 3856 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2313 ConjunctsInSsa, 233 ConjunctsInUnsatCore, 24 InterpolantComputations, 10 PerfectInterpolantSequences, 246/348 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:21:29,171 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...