/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/egcd-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 20:12:13,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 20:12:13,283 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 20:12:13,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 20:12:13,314 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 20:12:13,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 20:12:13,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 20:12:13,317 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 20:12:13,318 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 20:12:13,318 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 20:12:13,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 20:12:13,319 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 20:12:13,320 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 20:12:13,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 20:12:13,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 20:12:13,321 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 20:12:13,322 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 20:12:13,322 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 20:12:13,323 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 20:12:13,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 20:12:13,325 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 20:12:13,326 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 20:12:13,327 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 20:12:13,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 20:12:13,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 20:12:13,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 20:12:13,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 20:12:13,330 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 20:12:13,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 20:12:13,331 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 20:12:13,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 20:12:13,332 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 20:12:13,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 20:12:13,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 20:12:13,333 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 20:12:13,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 20:12:13,334 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 20:12:13,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 20:12:13,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 20:12:13,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 20:12:13,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 20:12:13,335 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 20:12:13,336 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-14 20:12:13,341 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 20:12:13,341 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 20:12:13,342 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 20:12:13,342 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 20:12:13,342 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 20:12:13,342 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 20:12:13,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 20:12:13,343 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 20:12:13,343 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 20:12:13,343 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 20:12:13,343 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 20:12:13,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 20:12:13,343 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 20:12:13,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 20:12:13,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 20:12:13,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 20:12:13,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-14 20:12:13,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 20:12:13,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:12:13,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 20:12:13,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 20:12:13,344 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-14 20:12:13,344 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-14 20:12:13,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 20:12:13,494 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 20:12:13,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 20:12:13,496 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 20:12:13,499 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 20:12:13,500 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-14 20:12:13,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54af7ab38/1e237bc0e74442c8be1ec3c12a52e6d1/FLAG013086e1f [2022-04-14 20:12:13,953 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 20:12:13,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/egcd-ll.c [2022-04-14 20:12:13,957 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54af7ab38/1e237bc0e74442c8be1ec3c12a52e6d1/FLAG013086e1f [2022-04-14 20:12:13,965 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54af7ab38/1e237bc0e74442c8be1ec3c12a52e6d1 [2022-04-14 20:12:13,966 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 20:12:13,967 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-14 20:12:13,968 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 20:12:13,968 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 20:12:13,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 20:12:13,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:12:13" (1/1) ... [2022-04-14 20:12:13,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@119df9ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:13, skipping insertion in model container [2022-04-14 20:12:13,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 08:12:13" (1/1) ... [2022-04-14 20:12:13,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 20:12:13,984 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 20:12:14,090 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/egcd-ll.c[489,502] [2022-04-14 20:12:14,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:12:14,112 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 20:12:14,119 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/egcd-ll.c[489,502] [2022-04-14 20:12:14,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 20:12:14,134 INFO L208 MainTranslator]: Completed translation [2022-04-14 20:12:14,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14 WrapperNode [2022-04-14 20:12:14,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 20:12:14,135 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 20:12:14,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 20:12:14,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 20:12:14,144 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14" (1/1) ... [2022-04-14 20:12:14,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14" (1/1) ... [2022-04-14 20:12:14,148 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14" (1/1) ... [2022-04-14 20:12:14,148 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14" (1/1) ... [2022-04-14 20:12:14,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14" (1/1) ... [2022-04-14 20:12:14,154 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14" (1/1) ... [2022-04-14 20:12:14,155 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14" (1/1) ... [2022-04-14 20:12:14,156 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 20:12:14,156 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 20:12:14,156 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 20:12:14,156 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 20:12:14,157 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14" (1/1) ... [2022-04-14 20:12:14,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 20:12:14,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:12:14,180 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-14 20:12:14,181 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-14 20:12:14,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 20:12:14,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 20:12:14,203 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 20:12:14,203 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 20:12:14,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 20:12:14,204 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 20:12:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 20:12:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 20:12:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 20:12:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 20:12:14,204 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-14 20:12:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 20:12:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 20:12:14,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 20:12:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 20:12:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 20:12:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 20:12:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 20:12:14,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 20:12:14,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 20:12:14,245 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 20:12:14,246 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 20:12:14,386 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 20:12:14,391 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 20:12:14,391 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 20:12:14,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:12:14 BoogieIcfgContainer [2022-04-14 20:12:14,392 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 20:12:14,393 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-14 20:12:14,393 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-14 20:12:14,393 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-14 20:12:14,395 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:12:14" (1/1) ... [2022-04-14 20:12:14,396 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-14 20:12:14,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:12:14 BasicIcfg [2022-04-14 20:12:14,416 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-14 20:12:14,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 20:12:14,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 20:12:14,420 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 20:12:14,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 08:12:13" (1/4) ... [2022-04-14 20:12:14,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768a9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:12:14, skipping insertion in model container [2022-04-14 20:12:14,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 08:12:14" (2/4) ... [2022-04-14 20:12:14,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768a9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 08:12:14, skipping insertion in model container [2022-04-14 20:12:14,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 08:12:14" (3/4) ... [2022-04-14 20:12:14,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@768a9c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:12:14, skipping insertion in model container [2022-04-14 20:12:14,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 14.04 08:12:14" (4/4) ... [2022-04-14 20:12:14,422 INFO L111 eAbstractionObserver]: Analyzing ICFG egcd-ll.cJordan [2022-04-14 20:12:14,425 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-14 20:12:14,425 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 20:12:14,451 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 20:12:14,457 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-14 20:12:14,457 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 20:12:14,477 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-14 20:12:14,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 20:12:14,484 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:12:14,484 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-14 20:12:14,485 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:12:14,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:12:14,491 INFO L85 PathProgramCache]: Analyzing trace with hash 589677296, now seen corresponding path program 1 times [2022-04-14 20:12:14,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:12:14,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604437219] [2022-04-14 20:12:14,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:14,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:12:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:14,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 20:12:14,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:14,677 INFO L290 TraceCheckUtils]: 0: Hoare triple {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-14 20:12:14,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 20:12:14,678 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 20:12:14,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 20:12:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:14,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [92] 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] {37#true} is VALID [2022-04-14 20:12:14,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [94] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {38#false} is VALID [2022-04-14 20:12:14,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-14 20:12:14,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:14,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [92] 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] {37#true} is VALID [2022-04-14 20:12:14,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [94] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {38#false} is VALID [2022-04-14 20:12:14,706 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 20:12:14,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {50#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-14 20:12:14,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 20:12:14,707 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 20:12:14,707 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-14 20:12:14,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {37#true} is VALID [2022-04-14 20:12:14,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {37#true} is VALID [2022-04-14 20:12:14,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [92] 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] {37#true} is VALID [2022-04-14 20:12:14,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [94] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,710 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {38#false} is VALID [2022-04-14 20:12:14,710 INFO L272 TraceCheckUtils]: 11: Hoare triple {38#false} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {37#true} is VALID [2022-04-14 20:12:14,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {37#true} [92] 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] {37#true} is VALID [2022-04-14 20:12:14,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [94] L8-->L8-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {38#false} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,712 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38#false} {38#false} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {38#false} is VALID [2022-04-14 20:12:14,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {38#false} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {38#false} is VALID [2022-04-14 20:12:14,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {38#false} [96] L41-2-->L33-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,717 INFO L272 TraceCheckUtils]: 18: Hoare triple {38#false} [100] L33-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {38#false} is VALID [2022-04-14 20:12:14,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {38#false} [103] __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] {38#false} is VALID [2022-04-14 20:12:14,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [106] 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[] {38#false} is VALID [2022-04-14 20:12:14,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {38#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-14 20:12:14,718 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-14 20:12:14,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:12:14,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604437219] [2022-04-14 20:12:14,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604437219] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:12:14,719 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:12:14,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 20:12:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294816011] [2022-04-14 20:12:14,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:12:14,724 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-14 20:12:14,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:12:14,727 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-14 20:12:14,748 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-14 20:12:14,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 20:12:14,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:12:14,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 20:12:14,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 20:12:14,769 INFO L87 Difference]: Start difference. First operand has 34 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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-14 20:12:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:14,899 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-14 20:12:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 20:12:14,899 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-14 20:12:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:12:14,900 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-14 20:12:14,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-14 20:12:14,906 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-14 20:12:14,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-14 20:12:14,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-14 20:12:14,961 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-14 20:12:14,969 INFO L225 Difference]: With dead ends: 34 [2022-04-14 20:12:14,970 INFO L226 Difference]: Without dead ends: 29 [2022-04-14 20:12:14,971 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-14 20:12:14,974 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:12:14,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:12:14,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-14 20:12:15,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-14 20:12:15,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:12:15,007 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 20:12:15,008 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 20:12:15,009 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 20:12:15,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:15,018 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-14 20:12:15,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-14 20:12:15,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:15,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:15,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-04-14 20:12:15,024 INFO L87 Difference]: Start difference. First operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 29 states. [2022-04-14 20:12:15,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:15,029 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2022-04-14 20:12:15,029 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-14 20:12:15,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:15,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:15,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:12:15,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:12:15,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-14 20:12:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-04-14 20:12:15,033 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 22 [2022-04-14 20:12:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:12:15,033 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-04-14 20:12:15,033 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-14 20:12:15,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-04-14 20:12:15,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-14 20:12:15,034 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:12:15,034 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-14 20:12:15,034 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 20:12:15,034 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:12:15,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:12:15,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1721458959, now seen corresponding path program 1 times [2022-04-14 20:12:15,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:12:15,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096223337] [2022-04-14 20:12:15,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:15,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:12:15,061 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:12:15,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789897258] [2022-04-14 20:12:15,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:15,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:12:15,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:12:15,070 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-14 20:12:15,071 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-14 20:12:15,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:15,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-14 20:12:15,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:15,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:12:15,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {174#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-14 20:12:15,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {174#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {174#true} is VALID [2022-04-14 20:12:15,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {174#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-14 20:12:15,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {174#true} {174#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-14 20:12:15,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {174#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-14 20:12:15,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {174#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {174#true} is VALID [2022-04-14 20:12:15,292 INFO L272 TraceCheckUtils]: 6: Hoare triple {174#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {174#true} is VALID [2022-04-14 20:12:15,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {174#true} [92] 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] {174#true} is VALID [2022-04-14 20:12:15,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {174#true} [95] 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[] {174#true} is VALID [2022-04-14 20:12:15,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {174#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-14 20:12:15,293 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {174#true} {174#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {174#true} is VALID [2022-04-14 20:12:15,293 INFO L272 TraceCheckUtils]: 11: Hoare triple {174#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {174#true} is VALID [2022-04-14 20:12:15,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {174#true} [92] 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] {174#true} is VALID [2022-04-14 20:12:15,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {174#true} [95] 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[] {174#true} is VALID [2022-04-14 20:12:15,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {174#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {174#true} is VALID [2022-04-14 20:12:15,297 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {174#true} {174#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {174#true} is VALID [2022-04-14 20:12:15,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {174#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {227#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-14 20:12:15,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {227#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {227#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} is VALID [2022-04-14 20:12:15,299 INFO L272 TraceCheckUtils]: 18: Hoare triple {227#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~p~0 1))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {234#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:15,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {234#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {238#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:15,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {238#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {175#false} is VALID [2022-04-14 20:12:15,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {175#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {175#false} is VALID [2022-04-14 20:12:15,300 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-14 20:12:15,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:12:15,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:12:15,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096223337] [2022-04-14 20:12:15,301 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:12:15,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789897258] [2022-04-14 20:12:15,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789897258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:12:15,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:12:15,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:12:15,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58329163] [2022-04-14 20:12:15,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:12:15,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 22 [2022-04-14 20:12:15,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:12:15,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-14 20:12:15,322 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-14 20:12:15,323 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:12:15,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:12:15,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:12:15,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:12:15,324 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-14 20:12:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:15,493 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-14 20:12:15,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:12:15,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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 22 [2022-04-14 20:12:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:12:15,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-14 20:12:15,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-14 20:12:15,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-14 20:12:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-14 20:12:15,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-14 20:12:15,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:15,544 INFO L225 Difference]: With dead ends: 43 [2022-04-14 20:12:15,544 INFO L226 Difference]: Without dead ends: 43 [2022-04-14 20:12:15,544 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 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-14 20:12:15,545 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:12:15,545 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 123 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:12:15,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-14 20:12:15,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2022-04-14 20:12:15,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:12:15,549 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 20:12:15,550 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 20:12:15,550 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 20:12:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:15,553 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-14 20:12:15,553 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-14 20:12:15,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:15,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:15,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-14 20:12:15,554 INFO L87 Difference]: Start difference. First operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 43 states. [2022-04-14 20:12:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:15,557 INFO L93 Difference]: Finished difference Result 43 states and 58 transitions. [2022-04-14 20:12:15,557 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2022-04-14 20:12:15,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:15,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:15,558 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:12:15,558 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:12:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 17 states have call successors, (17), 5 states have call predecessors, (17), 4 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 20:12:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 57 transitions. [2022-04-14 20:12:15,560 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 57 transitions. Word has length 22 [2022-04-14 20:12:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:12:15,560 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 57 transitions. [2022-04-14 20:12:15,560 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 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-14 20:12:15,561 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 57 transitions. [2022-04-14 20:12:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 20:12:15,561 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:12:15,561 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] [2022-04-14 20:12:15,577 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-14 20:12:15,771 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-14 20:12:15,771 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:12:15,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:12:15,771 INFO L85 PathProgramCache]: Analyzing trace with hash 491128363, now seen corresponding path program 1 times [2022-04-14 20:12:15,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:12:15,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46884401] [2022-04-14 20:12:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:15,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:12:15,798 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:12:15,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [983949149] [2022-04-14 20:12:15,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:15,798 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:12:15,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:12:15,799 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-14 20:12:15,817 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-14 20:12:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:15,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-14 20:12:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:15,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:12:16,012 INFO L272 TraceCheckUtils]: 0: Hoare triple {417#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#true} is VALID [2022-04-14 20:12:16,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {417#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {417#true} is VALID [2022-04-14 20:12:16,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {417#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#true} is VALID [2022-04-14 20:12:16,013 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {417#true} {417#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#true} is VALID [2022-04-14 20:12:16,013 INFO L272 TraceCheckUtils]: 4: Hoare triple {417#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#true} is VALID [2022-04-14 20:12:16,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {417#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {417#true} is VALID [2022-04-14 20:12:16,014 INFO L272 TraceCheckUtils]: 6: Hoare triple {417#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {417#true} is VALID [2022-04-14 20:12:16,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {417#true} [92] 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] {417#true} is VALID [2022-04-14 20:12:16,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {417#true} [95] 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[] {417#true} is VALID [2022-04-14 20:12:16,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {417#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#true} is VALID [2022-04-14 20:12:16,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {417#true} {417#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {417#true} is VALID [2022-04-14 20:12:16,014 INFO L272 TraceCheckUtils]: 11: Hoare triple {417#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {417#true} is VALID [2022-04-14 20:12:16,017 INFO L290 TraceCheckUtils]: 12: Hoare triple {417#true} [92] 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] {458#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 20:12:16,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {458#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [95] 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[] {462#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 20:12:16,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {462#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {462#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 20:12:16,019 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {462#(not (= |assume_abort_if_not_#in~cond| 0))} {417#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {469#(<= 1 main_~y~0)} is VALID [2022-04-14 20:12:16,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {469#(<= 1 main_~y~0)} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {473#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:16,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {473#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {473#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:16,020 INFO L272 TraceCheckUtils]: 18: Hoare triple {473#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {417#true} is VALID [2022-04-14 20:12:16,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {417#true} [103] __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] {417#true} is VALID [2022-04-14 20:12:16,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {417#true} [107] 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[] {417#true} is VALID [2022-04-14 20:12:16,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {417#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {417#true} is VALID [2022-04-14 20:12:16,021 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {417#true} {473#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {473#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:16,022 INFO L272 TraceCheckUtils]: 23: Hoare triple {473#(and (= main_~r~0 0) (<= 1 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {495#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:16,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {495#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {499#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:16,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {499#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {418#false} is VALID [2022-04-14 20:12:16,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {418#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {418#false} is VALID [2022-04-14 20:12:16,024 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-14 20:12:16,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:12:16,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:12:16,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46884401] [2022-04-14 20:12:16,024 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:12:16,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983949149] [2022-04-14 20:12:16,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983949149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:12:16,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:12:16,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-14 20:12:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461465623] [2022-04-14 20:12:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:12:16,025 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 27 [2022-04-14 20:12:16,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:12:16,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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-14 20:12:16,042 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:16,042 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 20:12:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:12:16,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 20:12:16,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-14 20:12:16,043 INFO L87 Difference]: Start difference. First operand 42 states and 57 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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-14 20:12:16,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:16,337 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-14 20:12:16,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 20:12:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 27 [2022-04-14 20:12:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:12:16,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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-14 20:12:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-14 20:12:16,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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-14 20:12:16,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 59 transitions. [2022-04-14 20:12:16,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 59 transitions. [2022-04-14 20:12:16,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:16,393 INFO L225 Difference]: With dead ends: 47 [2022-04-14 20:12:16,393 INFO L226 Difference]: Without dead ends: 47 [2022-04-14 20:12:16,394 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-14 20:12:16,394 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 20 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:12:16,394 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 148 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:12:16,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-14 20:12:16,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-04-14 20:12:16,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:12:16,398 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 20:12:16,398 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 20:12:16,399 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 20:12:16,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:16,401 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-14 20:12:16,401 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-14 20:12:16,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:16,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:16,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-14 20:12:16,402 INFO L87 Difference]: Start difference. First operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand 47 states. [2022-04-14 20:12:16,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:16,404 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-04-14 20:12:16,404 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 61 transitions. [2022-04-14 20:12:16,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:16,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:16,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:12:16,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:12:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 25 states have internal predecessors, (28), 17 states have call successors, (17), 6 states have call predecessors, (17), 5 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-14 20:12:16,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-04-14 20:12:16,406 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 27 [2022-04-14 20:12:16,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:12:16,407 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-04-14 20:12:16,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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-14 20:12:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-04-14 20:12:16,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-14 20:12:16,407 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:12:16,407 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] [2022-04-14 20:12:16,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-14 20:12:16,623 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-14 20:12:16,623 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:12:16,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:12:16,623 INFO L85 PathProgramCache]: Analyzing trace with hash 70646830, now seen corresponding path program 1 times [2022-04-14 20:12:16,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:12:16,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375958205] [2022-04-14 20:12:16,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:16,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:12:16,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:12:16,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1389146825] [2022-04-14 20:12:16,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:16,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:12:16,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:12:16,637 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-14 20:12:16,638 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-14 20:12:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:16,667 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-14 20:12:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:16,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:12:16,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {696#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:16,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {696#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {696#true} is VALID [2022-04-14 20:12:16,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {696#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:16,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:16,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {696#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:16,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {696#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {696#true} is VALID [2022-04-14 20:12:16,860 INFO L272 TraceCheckUtils]: 6: Hoare triple {696#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {696#true} is VALID [2022-04-14 20:12:16,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {696#true} [92] 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] {722#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 20:12:16,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {722#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [95] 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[] {726#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 20:12:16,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {726#(not (= |assume_abort_if_not_#in~cond| 0))} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {726#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 20:12:16,861 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {726#(not (= |assume_abort_if_not_#in~cond| 0))} {696#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {733#(<= 1 main_~x~0)} is VALID [2022-04-14 20:12:16,861 INFO L272 TraceCheckUtils]: 11: Hoare triple {733#(<= 1 main_~x~0)} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {696#true} is VALID [2022-04-14 20:12:16,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {696#true} [92] 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] {696#true} is VALID [2022-04-14 20:12:16,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {696#true} [95] 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[] {696#true} is VALID [2022-04-14 20:12:16,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {696#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:16,862 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {696#true} {733#(<= 1 main_~x~0)} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {733#(<= 1 main_~x~0)} is VALID [2022-04-14 20:12:16,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {733#(<= 1 main_~x~0)} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:12:16,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:12:16,863 INFO L272 TraceCheckUtils]: 18: Hoare triple {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {696#true} is VALID [2022-04-14 20:12:16,863 INFO L290 TraceCheckUtils]: 19: Hoare triple {696#true} [103] __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] {696#true} is VALID [2022-04-14 20:12:16,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {696#true} [107] 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[] {696#true} is VALID [2022-04-14 20:12:16,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {696#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:16,866 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {696#true} {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:12:16,866 INFO L272 TraceCheckUtils]: 23: Hoare triple {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {696#true} is VALID [2022-04-14 20:12:16,866 INFO L290 TraceCheckUtils]: 24: Hoare triple {696#true} [103] __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] {696#true} is VALID [2022-04-14 20:12:16,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {696#true} [107] 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[] {696#true} is VALID [2022-04-14 20:12:16,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {696#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:16,867 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {696#true} {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} is VALID [2022-04-14 20:12:16,868 INFO L272 TraceCheckUtils]: 28: Hoare triple {752#(and (<= 1 main_~x~0) (= main_~s~0 1) (= main_~b~0 main_~y~0) (= main_~q~0 0))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {789#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:16,868 INFO L290 TraceCheckUtils]: 29: Hoare triple {789#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {793#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:16,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {793#(<= 1 __VERIFIER_assert_~cond)} [106] 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-14 20:12:16,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {697#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {697#false} is VALID [2022-04-14 20:12:16,869 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-04-14 20:12:16,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:12:17,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {697#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {697#false} is VALID [2022-04-14 20:12:17,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {793#(<= 1 __VERIFIER_assert_~cond)} [106] 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-14 20:12:17,063 INFO L290 TraceCheckUtils]: 29: Hoare triple {789#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {793#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:17,064 INFO L272 TraceCheckUtils]: 28: Hoare triple {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {789#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:17,065 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {696#true} {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 20:12:17,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {696#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:17,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {696#true} [107] 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[] {696#true} is VALID [2022-04-14 20:12:17,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {696#true} [103] __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] {696#true} is VALID [2022-04-14 20:12:17,065 INFO L272 TraceCheckUtils]: 23: Hoare triple {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {696#true} is VALID [2022-04-14 20:12:17,066 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {696#true} {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 20:12:17,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {696#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:17,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {696#true} [107] 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[] {696#true} is VALID [2022-04-14 20:12:17,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {696#true} [103] __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] {696#true} is VALID [2022-04-14 20:12:17,066 INFO L272 TraceCheckUtils]: 18: Hoare triple {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {696#true} is VALID [2022-04-14 20:12:17,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 20:12:17,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {696#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {809#(= main_~b~0 (+ (* main_~q~0 main_~x~0) (* main_~y~0 main_~s~0)))} is VALID [2022-04-14 20:12:17,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {696#true} {696#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {696#true} is VALID [2022-04-14 20:12:17,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {696#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {696#true} [95] 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[] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {696#true} [92] 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] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {696#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {696#true} {696#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {696#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {696#true} [95] 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[] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {696#true} [92] 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] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {696#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L290 TraceCheckUtils]: 5: Hoare triple {696#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {696#true} is VALID [2022-04-14 20:12:17,068 INFO L272 TraceCheckUtils]: 4: Hoare triple {696#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:17,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:17,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {696#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:17,069 INFO L290 TraceCheckUtils]: 1: Hoare triple {696#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {696#true} is VALID [2022-04-14 20:12:17,069 INFO L272 TraceCheckUtils]: 0: Hoare triple {696#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {696#true} is VALID [2022-04-14 20:12:17,069 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-14 20:12:17,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:12:17,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375958205] [2022-04-14 20:12:17,069 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:12:17,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389146825] [2022-04-14 20:12:17,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389146825] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:12:17,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 20:12:17,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-04-14 20:12:17,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274647373] [2022-04-14 20:12:17,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:12:17,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 32 [2022-04-14 20:12:17,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:12:17,070 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-14 20:12:17,087 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-14 20:12:17,087 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:12:17,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:12:17,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:12:17,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-04-14 20:12:17,088 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-14 20:12:17,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:17,236 INFO L93 Difference]: Finished difference Result 69 states and 98 transitions. [2022-04-14 20:12:17,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:12:17,236 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 32 [2022-04-14 20:12:17,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:12:17,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-14 20:12:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-14 20:12:17,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-14 20:12:17,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-14 20:12:17,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-14 20:12:17,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:17,283 INFO L225 Difference]: With dead ends: 69 [2022-04-14 20:12:17,284 INFO L226 Difference]: Without dead ends: 67 [2022-04-14 20:12:17,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-14 20:12:17,284 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 8 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:12:17,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 120 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:12:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-14 20:12:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-04-14 20:12:17,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:12:17,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 20:12:17,290 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 20:12:17,290 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 20:12:17,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:17,293 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-14 20:12:17,293 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-14 20:12:17,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:17,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:17,294 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-14 20:12:17,294 INFO L87 Difference]: Start difference. First operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 67 states. [2022-04-14 20:12:17,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:17,296 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-04-14 20:12:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-14 20:12:17,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:17,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:17,297 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:12:17,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:12:17,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 32 states have (on average 1.28125) internal successors, (41), 36 states have internal predecessors, (41), 28 states have call successors, (28), 7 states have call predecessors, (28), 6 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 20:12:17,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2022-04-14 20:12:17,301 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 32 [2022-04-14 20:12:17,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:12:17,302 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2022-04-14 20:12:17,302 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-14 20:12:17,302 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-04-14 20:12:17,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-14 20:12:17,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:12:17,302 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] [2022-04-14 20:12:17,320 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-14 20:12:17,502 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-14 20:12:17,503 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:12:17,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:12:17,503 INFO L85 PathProgramCache]: Analyzing trace with hash 399873803, now seen corresponding path program 1 times [2022-04-14 20:12:17,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:12:17,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181736938] [2022-04-14 20:12:17,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:17,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:12:17,513 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:12:17,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1621084971] [2022-04-14 20:12:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:17,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:12:17,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:12:17,514 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-14 20:12:17,515 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-14 20:12:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:17,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 20:12:17,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:17,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:12:17,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {1168#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {1168#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1168#true} is VALID [2022-04-14 20:12:17,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {1168#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,630 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1168#true} {1168#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {1168#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {1168#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {1168#true} is VALID [2022-04-14 20:12:17,631 INFO L272 TraceCheckUtils]: 6: Hoare triple {1168#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1168#true} is VALID [2022-04-14 20:12:17,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {1168#true} [92] 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] {1168#true} is VALID [2022-04-14 20:12:17,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {1168#true} [95] 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[] {1168#true} is VALID [2022-04-14 20:12:17,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {1168#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,631 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1168#true} {1168#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1168#true} is VALID [2022-04-14 20:12:17,631 INFO L272 TraceCheckUtils]: 11: Hoare triple {1168#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1168#true} is VALID [2022-04-14 20:12:17,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {1168#true} [92] 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] {1168#true} is VALID [2022-04-14 20:12:17,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {1168#true} [95] 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[] {1168#true} is VALID [2022-04-14 20:12:17,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {1168#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1168#true} {1168#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {1168#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {1168#true} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L272 TraceCheckUtils]: 18: Hoare triple {1168#true} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {1168#true} [103] __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] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {1168#true} [107] 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[] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {1168#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1168#true} {1168#true} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L272 TraceCheckUtils]: 23: Hoare triple {1168#true} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {1168#true} [103] __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] {1168#true} is VALID [2022-04-14 20:12:17,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {1168#true} [107] 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[] {1168#true} is VALID [2022-04-14 20:12:17,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {1168#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,633 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1168#true} {1168#true} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1168#true} is VALID [2022-04-14 20:12:17,633 INFO L272 TraceCheckUtils]: 28: Hoare triple {1168#true} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1168#true} is VALID [2022-04-14 20:12:17,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {1168#true} [103] __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] {1168#true} is VALID [2022-04-14 20:12:17,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {1168#true} [107] 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[] {1168#true} is VALID [2022-04-14 20:12:17,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {1168#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1168#true} is VALID [2022-04-14 20:12:17,633 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1168#true} {1168#true} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1168#true} is VALID [2022-04-14 20:12:17,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {1168#true} [113] L36-->L33-2: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {1272#(= main_~b~0 main_~a~0)} is VALID [2022-04-14 20:12:17,634 INFO L272 TraceCheckUtils]: 34: Hoare triple {1272#(= main_~b~0 main_~a~0)} [100] L33-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {1276#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:17,634 INFO L290 TraceCheckUtils]: 35: Hoare triple {1276#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {1280#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:17,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {1280#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {1169#false} is VALID [2022-04-14 20:12:17,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {1169#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1169#false} is VALID [2022-04-14 20:12:17,635 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-14 20:12:17,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:12:17,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:12:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181736938] [2022-04-14 20:12:17,635 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:12:17,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621084971] [2022-04-14 20:12:17,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621084971] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:12:17,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:12:17,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:12:17,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147450564] [2022-04-14 20:12:17,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:12:17,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-14 20:12:17,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:12:17,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 20:12:17,653 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-14 20:12:17,653 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:12:17,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:12:17,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:12:17,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:12:17,654 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 20:12:17,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:17,772 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-14 20:12:17,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:12:17,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 38 [2022-04-14 20:12:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:12:17,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 20:12:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-14 20:12:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 20:12:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-14 20:12:17,774 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-14 20:12:17,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:17,802 INFO L225 Difference]: With dead ends: 71 [2022-04-14 20:12:17,802 INFO L226 Difference]: Without dead ends: 71 [2022-04-14 20:12:17,803 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 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-14 20:12:17,803 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:12:17,803 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 119 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:12:17,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-14 20:12:17,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-04-14 20:12:17,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:12:17,807 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 20:12:17,808 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 20:12:17,808 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 20:12:17,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:17,810 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-14 20:12:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-14 20:12:17,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:17,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:17,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-14 20:12:17,811 INFO L87 Difference]: Start difference. First operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) Second operand 71 states. [2022-04-14 20:12:17,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:17,813 INFO L93 Difference]: Finished difference Result 71 states and 96 transitions. [2022-04-14 20:12:17,813 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-14 20:12:17,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:17,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:17,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:12:17,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:12:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 35 states have (on average 1.2571428571428571) internal successors, (44), 39 states have internal predecessors, (44), 28 states have call successors, (28), 8 states have call predecessors, (28), 7 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-14 20:12:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 96 transitions. [2022-04-14 20:12:17,816 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 96 transitions. Word has length 38 [2022-04-14 20:12:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:12:17,816 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 96 transitions. [2022-04-14 20:12:17,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-04-14 20:12:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 96 transitions. [2022-04-14 20:12:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-14 20:12:17,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:12:17,817 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 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] [2022-04-14 20:12:17,833 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-14 20:12:18,031 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-14 20:12:18,031 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:12:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:12:18,032 INFO L85 PathProgramCache]: Analyzing trace with hash -927531751, now seen corresponding path program 1 times [2022-04-14 20:12:18,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:12:18,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508804971] [2022-04-14 20:12:18,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:18,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:12:18,041 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:12:18,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1928569542] [2022-04-14 20:12:18,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:18,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:12:18,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:12:18,042 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-14 20:12:18,043 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-14 20:12:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:18,077 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 20:12:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:18,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:12:18,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {1572#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#true} is VALID [2022-04-14 20:12:18,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {1572#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {1572#true} is VALID [2022-04-14 20:12:18,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#true} is VALID [2022-04-14 20:12:18,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1572#true} {1572#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#true} is VALID [2022-04-14 20:12:18,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {1572#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#true} is VALID [2022-04-14 20:12:18,217 INFO L290 TraceCheckUtils]: 5: Hoare triple {1572#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {1572#true} is VALID [2022-04-14 20:12:18,217 INFO L272 TraceCheckUtils]: 6: Hoare triple {1572#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1572#true} is VALID [2022-04-14 20:12:18,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {1572#true} [92] 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] {1572#true} is VALID [2022-04-14 20:12:18,218 INFO L290 TraceCheckUtils]: 8: Hoare triple {1572#true} [95] 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[] {1572#true} is VALID [2022-04-14 20:12:18,218 INFO L290 TraceCheckUtils]: 9: Hoare triple {1572#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#true} is VALID [2022-04-14 20:12:18,218 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1572#true} {1572#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {1572#true} is VALID [2022-04-14 20:12:18,218 INFO L272 TraceCheckUtils]: 11: Hoare triple {1572#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1572#true} is VALID [2022-04-14 20:12:18,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {1572#true} [92] 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] {1572#true} is VALID [2022-04-14 20:12:18,218 INFO L290 TraceCheckUtils]: 13: Hoare triple {1572#true} [95] 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[] {1572#true} is VALID [2022-04-14 20:12:18,218 INFO L290 TraceCheckUtils]: 14: Hoare triple {1572#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#true} is VALID [2022-04-14 20:12:18,218 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1572#true} {1572#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {1572#true} is VALID [2022-04-14 20:12:18,219 INFO L290 TraceCheckUtils]: 16: Hoare triple {1572#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:18,219 INFO L290 TraceCheckUtils]: 17: Hoare triple {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:18,219 INFO L272 TraceCheckUtils]: 18: Hoare triple {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1572#true} is VALID [2022-04-14 20:12:18,219 INFO L290 TraceCheckUtils]: 19: Hoare triple {1572#true} [103] __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] {1572#true} is VALID [2022-04-14 20:12:18,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {1572#true} [107] 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[] {1572#true} is VALID [2022-04-14 20:12:18,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {1572#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#true} is VALID [2022-04-14 20:12:18,220 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1572#true} {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:18,220 INFO L272 TraceCheckUtils]: 23: Hoare triple {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1572#true} is VALID [2022-04-14 20:12:18,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {1572#true} [103] __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] {1572#true} is VALID [2022-04-14 20:12:18,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {1572#true} [107] 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[] {1572#true} is VALID [2022-04-14 20:12:18,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {1572#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#true} is VALID [2022-04-14 20:12:18,221 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1572#true} {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:18,221 INFO L272 TraceCheckUtils]: 28: Hoare triple {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1572#true} is VALID [2022-04-14 20:12:18,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {1572#true} [103] __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] {1572#true} is VALID [2022-04-14 20:12:18,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {1572#true} [107] 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[] {1572#true} is VALID [2022-04-14 20:12:18,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {1572#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1572#true} is VALID [2022-04-14 20:12:18,222 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1572#true} {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:18,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-->L41: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:18,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:18,223 INFO L290 TraceCheckUtils]: 35: Hoare triple {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:18,223 INFO L272 TraceCheckUtils]: 36: Hoare triple {1625#(and (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:18,224 INFO L290 TraceCheckUtils]: 37: Hoare triple {1686#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {1690#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:18,224 INFO L290 TraceCheckUtils]: 38: Hoare triple {1690#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {1573#false} is VALID [2022-04-14 20:12:18,224 INFO L290 TraceCheckUtils]: 39: Hoare triple {1573#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1573#false} is VALID [2022-04-14 20:12:18,225 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-04-14 20:12:18,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 20:12:18,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:12:18,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508804971] [2022-04-14 20:12:18,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:12:18,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1928569542] [2022-04-14 20:12:18,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1928569542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 20:12:18,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 20:12:18,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 20:12:18,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013972729] [2022-04-14 20:12:18,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:12:18,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 40 [2022-04-14 20:12:18,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:12:18,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-14 20:12:18,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:18,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:12:18,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:12:18,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:12:18,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 20:12:18,245 INFO L87 Difference]: Start difference. First operand 71 states and 96 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-14 20:12:18,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:18,371 INFO L93 Difference]: Finished difference Result 79 states and 102 transitions. [2022-04-14 20:12:18,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:12:18,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 40 [2022-04-14 20:12:18,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:12:18,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-14 20:12:18,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-14 20:12:18,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-14 20:12:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-04-14 20:12:18,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-04-14 20:12:18,414 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-14 20:12:18,415 INFO L225 Difference]: With dead ends: 79 [2022-04-14 20:12:18,415 INFO L226 Difference]: Without dead ends: 78 [2022-04-14 20:12:18,415 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 20:12:18,416 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:12:18,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 126 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:12:18,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-04-14 20:12:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-04-14 20:12:18,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:12:18,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-14 20:12:18,420 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-14 20:12:18,420 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-14 20:12:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:18,422 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-14 20:12:18,422 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-14 20:12:18,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:18,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:18,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-14 20:12:18,423 INFO L87 Difference]: Start difference. First operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) Second operand 78 states. [2022-04-14 20:12:18,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:18,425 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-04-14 20:12:18,425 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 100 transitions. [2022-04-14 20:12:18,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:18,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:18,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:12:18,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:12:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 44 states have internal predecessors, (50), 25 states have call successors, (25), 10 states have call predecessors, (25), 9 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-14 20:12:18,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 97 transitions. [2022-04-14 20:12:18,428 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 97 transitions. Word has length 40 [2022-04-14 20:12:18,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:12:18,428 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 97 transitions. [2022-04-14 20:12:18,428 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-14 20:12:18,428 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 97 transitions. [2022-04-14 20:12:18,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-14 20:12:18,428 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:12:18,428 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 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-14 20:12:18,446 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-14 20:12:18,644 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-14 20:12:18,644 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:12:18,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:12:18,645 INFO L85 PathProgramCache]: Analyzing trace with hash -2093519850, now seen corresponding path program 1 times [2022-04-14 20:12:18,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:12:18,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813728100] [2022-04-14 20:12:18,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:18,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:12:18,653 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:12:18,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1001156958] [2022-04-14 20:12:18,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:18,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:12:18,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:12:18,654 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-14 20:12:18,655 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-14 20:12:18,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:18,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-14 20:12:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:18,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:12:18,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {2009#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {2009#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2009#true} is VALID [2022-04-14 20:12:18,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {2009#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2009#true} {2009#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {2009#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {2009#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L272 TraceCheckUtils]: 6: Hoare triple {2009#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {2009#true} [92] 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] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {2009#true} [95] 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[] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {2009#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2009#true} {2009#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L272 TraceCheckUtils]: 11: Hoare triple {2009#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L290 TraceCheckUtils]: 12: Hoare triple {2009#true} [92] 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] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L290 TraceCheckUtils]: 13: Hoare triple {2009#true} [95] 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[] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {2009#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2009#true} {2009#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {2009#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2009#true} is VALID [2022-04-14 20:12:18,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {2009#true} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,838 INFO L272 TraceCheckUtils]: 18: Hoare triple {2009#true} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2009#true} is VALID [2022-04-14 20:12:18,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {2009#true} [103] __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] {2009#true} is VALID [2022-04-14 20:12:18,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {2009#true} [107] 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[] {2009#true} is VALID [2022-04-14 20:12:18,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {2009#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,838 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2009#true} {2009#true} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2009#true} is VALID [2022-04-14 20:12:18,838 INFO L272 TraceCheckUtils]: 23: Hoare triple {2009#true} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2009#true} is VALID [2022-04-14 20:12:18,842 INFO L290 TraceCheckUtils]: 24: Hoare triple {2009#true} [103] __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] {2086#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:18,842 INFO L290 TraceCheckUtils]: 25: Hoare triple {2086#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} [107] 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[] {2090#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:12:18,843 INFO L290 TraceCheckUtils]: 26: Hoare triple {2090#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2090#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:12:18,843 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2090#(not (= |__VERIFIER_assert_#in~cond| 0))} {2009#true} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:18,844 INFO L272 TraceCheckUtils]: 28: Hoare triple {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2009#true} is VALID [2022-04-14 20:12:18,844 INFO L290 TraceCheckUtils]: 29: Hoare triple {2009#true} [103] __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] {2009#true} is VALID [2022-04-14 20:12:18,844 INFO L290 TraceCheckUtils]: 30: Hoare triple {2009#true} [107] 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[] {2009#true} is VALID [2022-04-14 20:12:18,844 INFO L290 TraceCheckUtils]: 31: Hoare triple {2009#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,845 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2009#true} {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:18,845 INFO L290 TraceCheckUtils]: 33: Hoare triple {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [113] L36-->L33-2: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:18,845 INFO L272 TraceCheckUtils]: 34: Hoare triple {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [100] L33-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2009#true} is VALID [2022-04-14 20:12:18,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {2009#true} [103] __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] {2009#true} is VALID [2022-04-14 20:12:18,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {2009#true} [107] 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[] {2009#true} is VALID [2022-04-14 20:12:18,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {2009#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:18,846 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2009#true} {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [125] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:18,847 INFO L272 TraceCheckUtils]: 39: Hoare triple {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [102] L52-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~r~0_12 v_main_~y~0_13) (* v_main_~p~0_12 v_main_~x~0_13)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:18,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {2135#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {2139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:18,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {2139#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {2010#false} is VALID [2022-04-14 20:12:18,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {2010#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2010#false} is VALID [2022-04-14 20:12:18,848 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 20:12:18,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:12:34,348 INFO L290 TraceCheckUtils]: 42: Hoare triple {2010#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2010#false} is VALID [2022-04-14 20:12:34,348 INFO L290 TraceCheckUtils]: 41: Hoare triple {2139#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {2010#false} is VALID [2022-04-14 20:12:34,349 INFO L290 TraceCheckUtils]: 40: Hoare triple {2135#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {2139#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:34,349 INFO L272 TraceCheckUtils]: 39: Hoare triple {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [102] L52-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_5| (ite (= (+ (* (- 1) v_main_~b~0_14) (* v_main_~r~0_12 v_main_~y~0_13) (* v_main_~p~0_12 v_main_~x~0_13)) 0) 1 0)) InVars {main_~y~0=v_main_~y~0_13, main_~x~0=v_main_~x~0_13, main_~b~0=v_main_~b~0_14, main_~p~0=v_main_~p~0_12, main_~r~0=v_main_~r~0_12} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_5|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~p~0, main_~r~0] {2135#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:34,350 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2009#true} {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [125] __VERIFIER_assertEXIT-->L52: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:34,350 INFO L290 TraceCheckUtils]: 37: Hoare triple {2009#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,350 INFO L290 TraceCheckUtils]: 36: Hoare triple {2009#true} [107] 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[] {2009#true} is VALID [2022-04-14 20:12:34,350 INFO L290 TraceCheckUtils]: 35: Hoare triple {2009#true} [103] __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] {2009#true} is VALID [2022-04-14 20:12:34,350 INFO L272 TraceCheckUtils]: 34: Hoare triple {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [100] L33-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (+ (* (- 1) v_main_~b~0_13) v_main_~a~0_11) 0) 1 0)) InVars {main_~b~0=v_main_~b~0_13, main_~a~0=v_main_~a~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~b~0, main_~a~0] {2009#true} is VALID [2022-04-14 20:12:34,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [113] L36-->L33-2: Formula: (= v_main_~a~0_8 v_main_~b~0_10) InVars {main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} OutVars{main_~b~0=v_main_~b~0_10, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[] {2116#(= main_~b~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:34,351 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2009#true} {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:34,351 INFO L290 TraceCheckUtils]: 31: Hoare triple {2009#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {2009#true} [107] 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[] {2009#true} is VALID [2022-04-14 20:12:34,352 INFO L290 TraceCheckUtils]: 29: Hoare triple {2009#true} [103] __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] {2009#true} is VALID [2022-04-14 20:12:34,352 INFO L272 TraceCheckUtils]: 28: Hoare triple {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2009#true} is VALID [2022-04-14 20:12:34,352 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2090#(not (= |__VERIFIER_assert_#in~cond| 0))} {2009#true} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2097#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:34,353 INFO L290 TraceCheckUtils]: 26: Hoare triple {2090#(not (= |__VERIFIER_assert_#in~cond| 0))} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2090#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:12:34,353 INFO L290 TraceCheckUtils]: 25: Hoare triple {2200#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} [107] 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[] {2090#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 20:12:34,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {2009#true} [103] __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] {2200#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 20:12:34,353 INFO L272 TraceCheckUtils]: 23: Hoare triple {2009#true} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2009#true} is VALID [2022-04-14 20:12:34,353 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2009#true} {2009#true} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {2009#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L290 TraceCheckUtils]: 20: Hoare triple {2009#true} [107] 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[] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L290 TraceCheckUtils]: 19: Hoare triple {2009#true} [103] __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] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L272 TraceCheckUtils]: 18: Hoare triple {2009#true} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {2009#true} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {2009#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2009#true} {2009#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {2009#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {2009#true} [95] 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[] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {2009#true} [92] 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] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L272 TraceCheckUtils]: 11: Hoare triple {2009#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2009#true} is VALID [2022-04-14 20:12:34,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2009#true} {2009#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L290 TraceCheckUtils]: 9: Hoare triple {2009#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L290 TraceCheckUtils]: 8: Hoare triple {2009#true} [95] 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[] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L290 TraceCheckUtils]: 7: Hoare triple {2009#true} [92] 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] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L272 TraceCheckUtils]: 6: Hoare triple {2009#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {2009#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {2009#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2009#true} {2009#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {2009#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {2009#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2009#true} is VALID [2022-04-14 20:12:34,355 INFO L272 TraceCheckUtils]: 0: Hoare triple {2009#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2009#true} is VALID [2022-04-14 20:12:34,356 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-14 20:12:34,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:12:34,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813728100] [2022-04-14 20:12:34,356 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:12:34,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001156958] [2022-04-14 20:12:34,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001156958] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:12:34,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:12:34,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2022-04-14 20:12:34,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38732318] [2022-04-14 20:12:34,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:12:34,357 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-14 20:12:34,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:12:34,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 20:12:34,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:34,380 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 20:12:34,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:12:34,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 20:12:34,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-04-14 20:12:34,381 INFO L87 Difference]: Start difference. First operand 76 states and 97 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 20:12:34,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:34,700 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-04-14 20:12:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-14 20:12:34,700 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 43 [2022-04-14 20:12:34,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:12:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 20:12:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-14 20:12:34,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 20:12:34,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 46 transitions. [2022-04-14 20:12:34,702 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 46 transitions. [2022-04-14 20:12:34,736 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-14 20:12:34,738 INFO L225 Difference]: With dead ends: 83 [2022-04-14 20:12:34,738 INFO L226 Difference]: Without dead ends: 81 [2022-04-14 20:12:34,738 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-14 20:12:34,738 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 13 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 20:12:34,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 106 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 20:12:34,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-14 20:12:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-14 20:12:34,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:12:34,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 20:12:34,742 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 20:12:34,743 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 20:12:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:34,745 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-14 20:12:34,745 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-14 20:12:34,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:34,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:34,745 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-14 20:12:34,745 INFO L87 Difference]: Start difference. First operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand 81 states. [2022-04-14 20:12:34,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:34,748 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-14 20:12:34,748 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-14 20:12:34,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:34,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:34,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:12:34,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:12:34,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 48 states have internal predecessors, (52), 25 states have call successors, (25), 11 states have call predecessors, (25), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-14 20:12:34,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2022-04-14 20:12:34,750 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 43 [2022-04-14 20:12:34,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:12:34,750 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2022-04-14 20:12:34,750 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2022-04-14 20:12:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-14 20:12:34,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-14 20:12:34,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:12:34,751 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] [2022-04-14 20:12:34,769 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-14 20:12:34,967 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-14 20:12:34,967 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:12:34,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:12:34,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1560297731, now seen corresponding path program 2 times [2022-04-14 20:12:34,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:12:34,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765015004] [2022-04-14 20:12:34,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:34,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:12:34,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:12:34,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1885699436] [2022-04-14 20:12:34,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-14 20:12:34,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:12:34,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:12:34,977 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-14 20:12:34,978 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-14 20:12:35,014 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-14 20:12:35,015 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-14 20:12:35,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-14 20:12:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:35,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:12:35,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {2607#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {2607#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2607#true} is VALID [2022-04-14 20:12:35,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {2607#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2607#true} {2607#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {2607#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {2607#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L272 TraceCheckUtils]: 6: Hoare triple {2607#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {2607#true} [92] 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] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {2607#true} [95] 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[] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {2607#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2607#true} {2607#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L272 TraceCheckUtils]: 11: Hoare triple {2607#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {2607#true} [92] 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] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {2607#true} [95] 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[] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L290 TraceCheckUtils]: 14: Hoare triple {2607#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,280 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2607#true} {2607#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2607#true} is VALID [2022-04-14 20:12:35,281 INFO L290 TraceCheckUtils]: 16: Hoare triple {2607#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2660#(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-14 20:12:35,281 INFO L290 TraceCheckUtils]: 17: Hoare triple {2660#(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))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2660#(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-14 20:12:35,281 INFO L272 TraceCheckUtils]: 18: Hoare triple {2660#(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))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2607#true} is VALID [2022-04-14 20:12:35,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {2607#true} [103] __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] {2607#true} is VALID [2022-04-14 20:12:35,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {2607#true} [107] 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[] {2607#true} is VALID [2022-04-14 20:12:35,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {2607#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,283 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2607#true} {2660#(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))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2660#(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-14 20:12:35,283 INFO L272 TraceCheckUtils]: 23: Hoare triple {2660#(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))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2607#true} is VALID [2022-04-14 20:12:35,284 INFO L290 TraceCheckUtils]: 24: Hoare triple {2607#true} [103] __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] {2607#true} is VALID [2022-04-14 20:12:35,284 INFO L290 TraceCheckUtils]: 25: Hoare triple {2607#true} [107] 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[] {2607#true} is VALID [2022-04-14 20:12:35,284 INFO L290 TraceCheckUtils]: 26: Hoare triple {2607#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,284 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2607#true} {2660#(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))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2660#(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-14 20:12:35,284 INFO L272 TraceCheckUtils]: 28: Hoare triple {2660#(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))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2607#true} is VALID [2022-04-14 20:12:35,285 INFO L290 TraceCheckUtils]: 29: Hoare triple {2607#true} [103] __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] {2607#true} is VALID [2022-04-14 20:12:35,285 INFO L290 TraceCheckUtils]: 30: Hoare triple {2607#true} [107] 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[] {2607#true} is VALID [2022-04-14 20:12:35,285 INFO L290 TraceCheckUtils]: 31: Hoare triple {2607#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,285 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2607#true} {2660#(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] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2660#(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-14 20:12:35,286 INFO L290 TraceCheckUtils]: 33: Hoare triple {2660#(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))} [114] L36-->L41: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2660#(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-14 20:12:35,286 INFO L290 TraceCheckUtils]: 34: Hoare triple {2660#(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))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {2715#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-14 20:12:35,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {2715#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2715#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-14 20:12:35,287 INFO L272 TraceCheckUtils]: 36: Hoare triple {2715#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2607#true} is VALID [2022-04-14 20:12:35,287 INFO L290 TraceCheckUtils]: 37: Hoare triple {2607#true} [103] __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] {2607#true} is VALID [2022-04-14 20:12:35,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {2607#true} [107] 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[] {2607#true} is VALID [2022-04-14 20:12:35,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {2607#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,287 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2607#true} {2715#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2715#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} is VALID [2022-04-14 20:12:35,288 INFO L272 TraceCheckUtils]: 41: Hoare triple {2715#(and (= (+ (* (- 1) main_~p~0) 1) 0) (= (+ main_~a~0 main_~y~0) main_~x~0) (= (* (- 1) main_~r~0) 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2737#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:35,288 INFO L290 TraceCheckUtils]: 42: Hoare triple {2737#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {2741#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:35,289 INFO L290 TraceCheckUtils]: 43: Hoare triple {2741#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {2608#false} is VALID [2022-04-14 20:12:35,289 INFO L290 TraceCheckUtils]: 44: Hoare triple {2608#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2608#false} is VALID [2022-04-14 20:12:35,289 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 20:12:35,289 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:12:35,468 INFO L290 TraceCheckUtils]: 44: Hoare triple {2608#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2608#false} is VALID [2022-04-14 20:12:35,469 INFO L290 TraceCheckUtils]: 43: Hoare triple {2741#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {2608#false} is VALID [2022-04-14 20:12:35,469 INFO L290 TraceCheckUtils]: 42: Hoare triple {2737#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {2741#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:35,470 INFO L272 TraceCheckUtils]: 41: Hoare triple {2757#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2737#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:35,470 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {2607#true} {2757#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2757#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:35,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {2607#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,471 INFO L290 TraceCheckUtils]: 38: Hoare triple {2607#true} [107] 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[] {2607#true} is VALID [2022-04-14 20:12:35,471 INFO L290 TraceCheckUtils]: 37: Hoare triple {2607#true} [103] __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] {2607#true} is VALID [2022-04-14 20:12:35,471 INFO L272 TraceCheckUtils]: 36: Hoare triple {2757#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2607#true} is VALID [2022-04-14 20:12:35,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {2757#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2757#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:35,631 INFO L290 TraceCheckUtils]: 34: Hoare triple {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {2757#(= main_~a~0 (+ (* main_~y~0 main_~r~0) (* main_~p~0 main_~x~0)))} is VALID [2022-04-14 20:12:35,632 INFO L290 TraceCheckUtils]: 33: Hoare triple {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [114] L36-->L41: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 20:12:35,633 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2607#true} {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 20:12:35,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {2607#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,633 INFO L290 TraceCheckUtils]: 30: Hoare triple {2607#true} [107] 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[] {2607#true} is VALID [2022-04-14 20:12:35,633 INFO L290 TraceCheckUtils]: 29: Hoare triple {2607#true} [103] __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] {2607#true} is VALID [2022-04-14 20:12:35,633 INFO L272 TraceCheckUtils]: 28: Hoare triple {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {2607#true} is VALID [2022-04-14 20:12:35,636 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2607#true} {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 20:12:35,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {2607#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {2607#true} [107] 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[] {2607#true} is VALID [2022-04-14 20:12:35,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {2607#true} [103] __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] {2607#true} is VALID [2022-04-14 20:12:35,639 INFO L272 TraceCheckUtils]: 23: Hoare triple {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {2607#true} is VALID [2022-04-14 20:12:35,641 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2607#true} {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 20:12:35,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {2607#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {2607#true} [107] 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[] {2607#true} is VALID [2022-04-14 20:12:35,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {2607#true} [103] __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] {2607#true} is VALID [2022-04-14 20:12:35,641 INFO L272 TraceCheckUtils]: 18: Hoare triple {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {2607#true} is VALID [2022-04-14 20:12:35,642 INFO L290 TraceCheckUtils]: 17: Hoare triple {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 20:12:35,642 INFO L290 TraceCheckUtils]: 16: Hoare triple {2607#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {2779#(= (+ main_~a~0 (* (- 1) main_~b~0)) (+ (* (+ main_~r~0 (* (- 1) main_~s~0)) main_~y~0) (* main_~x~0 (+ main_~p~0 (* (- 1) main_~q~0)))))} is VALID [2022-04-14 20:12:35,642 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2607#true} {2607#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2607#true} is VALID [2022-04-14 20:12:35,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {2607#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,642 INFO L290 TraceCheckUtils]: 13: Hoare triple {2607#true} [95] 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[] {2607#true} is VALID [2022-04-14 20:12:35,642 INFO L290 TraceCheckUtils]: 12: Hoare triple {2607#true} [92] 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] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L272 TraceCheckUtils]: 11: Hoare triple {2607#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2607#true} {2607#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {2607#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {2607#true} [95] 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[] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {2607#true} [92] 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] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L272 TraceCheckUtils]: 6: Hoare triple {2607#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {2607#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {2607#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2607#true} {2607#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {2607#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {2607#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {2607#true} is VALID [2022-04-14 20:12:35,656 INFO L272 TraceCheckUtils]: 0: Hoare triple {2607#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {2607#true} is VALID [2022-04-14 20:12:35,656 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-14 20:12:35,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:12:35,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765015004] [2022-04-14 20:12:35,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:12:35,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885699436] [2022-04-14 20:12:35,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885699436] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 20:12:35,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 20:12:35,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2022-04-14 20:12:35,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667102388] [2022-04-14 20:12:35,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 20:12:35,657 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 45 [2022-04-14 20:12:35,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:12:35,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 20:12:35,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:35,741 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-14 20:12:35,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:12:35,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-14 20:12:35,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 20:12:35,742 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 20:12:36,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:36,815 INFO L93 Difference]: Finished difference Result 105 states and 134 transitions. [2022-04-14 20:12:36,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 20:12:36,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 45 [2022-04-14 20:12:36,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:12:36,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 20:12:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-04-14 20:12:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 20:12:36,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 69 transitions. [2022-04-14 20:12:36,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 69 transitions. [2022-04-14 20:12:37,063 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-14 20:12:37,068 INFO L225 Difference]: With dead ends: 105 [2022-04-14 20:12:37,068 INFO L226 Difference]: Without dead ends: 100 [2022-04-14 20:12:37,068 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-04-14 20:12:37,069 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 12 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-14 20:12:37,069 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-14 20:12:37,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-14 20:12:37,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 85. [2022-04-14 20:12:37,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:12:37,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 20:12:37,073 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 20:12:37,073 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 20:12:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:37,078 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-14 20:12:37,078 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-14 20:12:37,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:37,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:37,078 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-14 20:12:37,079 INFO L87 Difference]: Start difference. First operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 100 states. [2022-04-14 20:12:37,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:37,081 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2022-04-14 20:12:37,081 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 123 transitions. [2022-04-14 20:12:37,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:37,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:37,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:12:37,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:12:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 53 states have internal predecessors, (57), 21 states have call successors, (21), 13 states have call predecessors, (21), 12 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-14 20:12:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-04-14 20:12:37,084 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 45 [2022-04-14 20:12:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:12:37,084 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-04-14 20:12:37,084 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 7 states have internal predecessors, (22), 5 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-14 20:12:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-04-14 20:12:37,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-14 20:12:37,084 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 20:12:37,084 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:12:37,103 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-14 20:12:37,300 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-14 20:12:37,301 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 20:12:37,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 20:12:37,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1002568160, now seen corresponding path program 1 times [2022-04-14 20:12:37,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 20:12:37,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673715927] [2022-04-14 20:12:37,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:37,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 20:12:37,312 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 20:12:37,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163016008] [2022-04-14 20:12:37,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 20:12:37,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 20:12:37,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 20:12:37,319 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-14 20:12:37,320 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-14 20:12:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:37,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-14 20:12:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 20:12:37,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 20:12:37,647 INFO L272 TraceCheckUtils]: 0: Hoare triple {3280#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {3280#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {3280#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L272 TraceCheckUtils]: 6: Hoare triple {3280#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L290 TraceCheckUtils]: 7: Hoare triple {3280#true} [92] 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] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L290 TraceCheckUtils]: 8: Hoare triple {3280#true} [95] 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[] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L290 TraceCheckUtils]: 9: Hoare triple {3280#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3280#true} {3280#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L272 TraceCheckUtils]: 11: Hoare triple {3280#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {3280#true} [92] 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] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#true} [95] 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[] {3280#true} is VALID [2022-04-14 20:12:37,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {3280#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,649 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3280#true} {3280#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {3280#true} is VALID [2022-04-14 20:12:37,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {3280#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:37,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:37,649 INFO L272 TraceCheckUtils]: 18: Hoare triple {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3280#true} is VALID [2022-04-14 20:12:37,650 INFO L290 TraceCheckUtils]: 19: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,650 INFO L290 TraceCheckUtils]: 20: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,650 INFO L290 TraceCheckUtils]: 21: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,650 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3280#true} {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:37,650 INFO L272 TraceCheckUtils]: 23: Hoare triple {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3280#true} is VALID [2022-04-14 20:12:37,651 INFO L290 TraceCheckUtils]: 24: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,651 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3280#true} {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:37,652 INFO L272 TraceCheckUtils]: 28: Hoare triple {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3280#true} is VALID [2022-04-14 20:12:37,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,653 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3280#true} {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:37,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [114] L36-->L41: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} is VALID [2022-04-14 20:12:37,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {3333#(and (= main_~r~0 0) (= main_~s~0 1) (= main_~q~0 0) (= main_~p~0 1))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 20:12:37,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 20:12:37,654 INFO L272 TraceCheckUtils]: 36: Hoare triple {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3280#true} is VALID [2022-04-14 20:12:37,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,655 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3280#true} {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 20:12:37,655 INFO L272 TraceCheckUtils]: 41: Hoare triple {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3280#true} is VALID [2022-04-14 20:12:37,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,656 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3280#true} {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 20:12:37,656 INFO L272 TraceCheckUtils]: 46: Hoare triple {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3280#true} is VALID [2022-04-14 20:12:37,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,657 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3280#true} {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 20:12:37,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [114] L36-->L41: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} is VALID [2022-04-14 20:12:37,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {3388#(and (= main_~s~0 1) (= main_~p~0 (+ (* (- 1) main_~q~0) 1)) (= main_~r~0 (* (- 1) main_~s~0)) (= main_~q~0 0))} [117] L41-->L41-2: Formula: (and (not (< v_main_~b~0_3 v_main_~a~0_3)) (= v_main_~b~0_2 (+ (* (- 1) v_main_~a~0_3) v_main_~b~0_3)) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, 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_3} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {3443#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-14 20:12:37,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {3443#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3443#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} is VALID [2022-04-14 20:12:37,659 INFO L272 TraceCheckUtils]: 54: Hoare triple {3443#(and (= main_~p~0 (+ (* (- 1) main_~q~0) (* (- 1) main_~p~0) 1)) (= (+ (* (- 1) main_~r~0) 1) main_~s~0) (= (- 1) main_~r~0) (= (+ main_~q~0 main_~p~0) 0))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:37,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {3450#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {3454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:37,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {3454#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {3281#false} is VALID [2022-04-14 20:12:37,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {3281#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3281#false} is VALID [2022-04-14 20:12:37,660 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-14 20:12:37,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 20:12:37,865 INFO L290 TraceCheckUtils]: 57: Hoare triple {3281#false} [110] L12-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3281#false} is VALID [2022-04-14 20:12:37,865 INFO L290 TraceCheckUtils]: 56: Hoare triple {3454#(<= 1 __VERIFIER_assert_~cond)} [106] 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[] {3281#false} is VALID [2022-04-14 20:12:37,865 INFO L290 TraceCheckUtils]: 55: Hoare triple {3450#(<= 1 |__VERIFIER_assert_#in~cond|)} [103] __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] {3454#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 20:12:37,866 INFO L272 TraceCheckUtils]: 54: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3450#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 20:12:37,866 INFO L290 TraceCheckUtils]: 53: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,869 INFO L290 TraceCheckUtils]: 52: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [117] L41-->L41-2: Formula: (and (not (< v_main_~b~0_3 v_main_~a~0_3)) (= v_main_~b~0_2 (+ (* (- 1) v_main_~a~0_3) v_main_~b~0_3)) (= (+ v_main_~q~0_3 (* (- 1) v_main_~p~0_3)) v_main_~q~0_2) (= v_main_~s~0_2 (+ (* (- 1) v_main_~r~0_3) v_main_~s~0_3))) InVars {main_~q~0=v_main_~q~0_3, 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_3} OutVars{main_~q~0=v_main_~q~0_2, main_~b~0=v_main_~b~0_2, main_~p~0=v_main_~p~0_3, main_~r~0=v_main_~r~0_3, main_~s~0=v_main_~s~0_2, main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~s~0] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [114] L36-->L41: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,870 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3280#true} {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,870 INFO L290 TraceCheckUtils]: 49: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,870 INFO L272 TraceCheckUtils]: 46: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3280#true} is VALID [2022-04-14 20:12:37,871 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3280#true} {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,871 INFO L272 TraceCheckUtils]: 41: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3280#true} is VALID [2022-04-14 20:12:37,872 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3280#true} {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,872 INFO L290 TraceCheckUtils]: 39: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,872 INFO L272 TraceCheckUtils]: 36: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3280#true} is VALID [2022-04-14 20:12:37,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,874 INFO L290 TraceCheckUtils]: 34: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [116] L41-->L41-2: Formula: (and (< v_main_~b~0_1 v_main_~a~0_2) (= v_main_~r~0_1 (+ v_main_~r~0_2 (* (- 1) v_main_~s~0_1))) (= v_main_~a~0_1 (+ v_main_~a~0_2 (* (- 1) v_main_~b~0_1))) (= v_main_~p~0_1 (+ (* (- 1) v_main_~q~0_1) v_main_~p~0_2))) InVars {main_~q~0=v_main_~q~0_1, main_~b~0=v_main_~b~0_1, main_~p~0=v_main_~p~0_2, main_~r~0=v_main_~r~0_2, main_~s~0=v_main_~s~0_1, main_~a~0=v_main_~a~0_2} OutVars{main_~q~0=v_main_~q~0_1, 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_~p~0, main_~r~0, main_~a~0] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [114] L36-->L41: Formula: (not (= v_main_~a~0_9 v_main_~b~0_11)) InVars {main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} OutVars{main_~b~0=v_main_~b~0_11, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,875 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3280#true} {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [124] __VERIFIER_assertEXIT-->L36: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,875 INFO L290 TraceCheckUtils]: 31: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,875 INFO L290 TraceCheckUtils]: 29: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,875 INFO L272 TraceCheckUtils]: 28: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [108] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~s~0_11 v_main_~y~0_12) (* v_main_~q~0_11 v_main_~x~0_12)) v_main_~b~0_12) 1 0) |v___VERIFIER_assert_#in~condInParam_3|) InVars {main_~q~0=v_main_~q~0_11, main_~y~0=v_main_~y~0_12, main_~x~0=v_main_~x~0_12, main_~b~0=v_main_~b~0_12, main_~s~0=v_main_~s~0_11} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_3|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~b~0, main_~s~0] {3280#true} is VALID [2022-04-14 20:12:37,876 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {3280#true} {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [123] __VERIFIER_assertEXIT-->L35: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,876 INFO L290 TraceCheckUtils]: 24: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,876 INFO L272 TraceCheckUtils]: 23: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [104] L34-1-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_11 v_main_~x~0_11) (* v_main_~r~0_11 v_main_~y~0_11)) v_main_~a~0_10) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_11, main_~x~0=v_main_~x~0_11, main_~p~0=v_main_~p~0_11, main_~r~0=v_main_~r~0_11, main_~a~0=v_main_~a~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~y~0, main_~p~0, main_~r~0, main_~a~0] {3280#true} is VALID [2022-04-14 20:12:37,877 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3280#true} {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [122] __VERIFIER_assertEXIT-->L34-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,877 INFO L290 TraceCheckUtils]: 21: Hoare triple {3280#true} [112] L11-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,877 INFO L290 TraceCheckUtils]: 20: Hoare triple {3280#true} [107] 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[] {3280#true} is VALID [2022-04-14 20:12:37,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {3280#true} [103] __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] {3280#true} is VALID [2022-04-14 20:12:37,877 INFO L272 TraceCheckUtils]: 18: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [101] L34-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~p~0_10 v_main_~s~0_10) (* (- 1) (* v_main_~q~0_10 v_main_~r~0_10))) 1) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~q~0=v_main_~q~0_10, main_~p~0=v_main_~p~0_10, main_~r~0=v_main_~r~0_10, main_~s~0=v_main_~s~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[main_~q~0, __VERIFIER_assert_#in~cond, main_~p~0, main_~r~0, main_~s~0] {3280#true} is VALID [2022-04-14 20:12:37,877 INFO L290 TraceCheckUtils]: 17: Hoare triple {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} [98] L41-2-->L34: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {3280#true} [93] L24-->L41-2: Formula: (and (= v_main_~r~0_7 0) (= v_main_~q~0_7 0) (= v_main_~s~0_7 1) (= v_main_~p~0_7 1) (= v_main_~b~0_8 v_main_~y~0_7) (= v_main_~a~0_6 v_main_~x~0_7)) InVars {main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7} OutVars{main_~q~0=v_main_~q~0_7, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_8, main_~p~0=v_main_~p~0_7, main_~r~0=v_main_~r~0_7, main_~s~0=v_main_~s~0_7, main_~a~0=v_main_~a~0_6} AuxVars[] AssignedVars[main_~q~0, main_~b~0, main_~p~0, main_~r~0, main_~s~0, main_~a~0] {3470#(= (* main_~p~0 main_~s~0) (+ (* main_~q~0 main_~r~0) 1))} is VALID [2022-04-14 20:12:37,878 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3280#true} {3280#true} [121] assume_abort_if_notEXIT-->L24: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L290 TraceCheckUtils]: 14: Hoare triple {3280#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#true} [95] 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[] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L290 TraceCheckUtils]: 12: Hoare triple {3280#true} [92] 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] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L272 TraceCheckUtils]: 11: Hoare triple {3280#true} [91] L23-1-->assume_abort_if_notENTRY: Formula: (= (ite (<= 1 v_main_~y~0_10) 1 0) |v_assume_abort_if_not_#in~condInParam_2|) InVars {main_~y~0=v_main_~y~0_10} 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] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3280#true} {3280#true} [120] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {3280#true} [99] L8-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {3280#true} [95] 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[] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L290 TraceCheckUtils]: 7: Hoare triple {3280#true} [92] 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] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L272 TraceCheckUtils]: 6: Hoare triple {3280#true} [90] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= 1 v_main_~x~0_10) 1 0)) InVars {main_~x~0=v_main_~x~0_10} 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] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L290 TraceCheckUtils]: 5: Hoare triple {3280#true} [88] mainENTRY-->L23: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~x~0_2 |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_2 |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_4, main_~x~0=v_main_~x~0_2, main_~y~0=v_main_~y~0_2, main_~b~0=v_main_~b~0_6, main_~p~0=v_main_~p~0_5, main_~r~0=v_main_~r~0_5, main_~s~0=v_main_~s~0_4, main_~a~0=v_main_~a~0_5} 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] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L272 TraceCheckUtils]: 4: Hoare triple {3280#true} [85] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,878 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} [119] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {3280#true} [89] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {3280#true} [86] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select |v_#length_1| 2) 10) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {3280#true} is VALID [2022-04-14 20:12:37,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {3280#true} [84] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {3280#true} is VALID [2022-04-14 20:12:37,879 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2022-04-14 20:12:37,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 20:12:37,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673715927] [2022-04-14 20:12:37,879 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 20:12:37,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163016008] [2022-04-14 20:12:37,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163016008] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 20:12:37,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 20:12:37,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2022-04-14 20:12:37,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194966844] [2022-04-14 20:12:37,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 20:12:37,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 58 [2022-04-14 20:12:37,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 20:12:37,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-14 20:12:37,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:37,906 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 20:12:37,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 20:12:37,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 20:12:37,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-14 20:12:37,907 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-14 20:12:38,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:38,031 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-04-14 20:12:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 20:12:38,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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 58 [2022-04-14 20:12:38,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 20:12:38,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-14 20:12:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-14 20:12:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-14 20:12:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-14 20:12:38,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-14 20:12:38,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 20:12:38,064 INFO L225 Difference]: With dead ends: 83 [2022-04-14 20:12:38,064 INFO L226 Difference]: Without dead ends: 0 [2022-04-14 20:12:38,064 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 106 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 20:12:38,064 INFO L913 BasicCegarLoop]: 28 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 20:12:38,064 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 88 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 20:12:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-14 20:12:38,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-14 20:12:38,065 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 20:12:38,065 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 20:12:38,065 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 20:12:38,065 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 20:12:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:38,065 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:12:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:12:38,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:38,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:38,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 20:12:38,065 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-14 20:12:38,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 20:12:38,065 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-14 20:12:38,065 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:12:38,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:38,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 20:12:38,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 20:12:38,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 20:12:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-14 20:12:38,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-14 20:12:38,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 58 [2022-04-14 20:12:38,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 20:12:38,066 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-14 20:12:38,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 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-14 20:12:38,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-14 20:12:38,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 20:12:38,068 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 20:12:38,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-14 20:12:38,280 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-14 20:12:38,283 INFO L719 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 20:12:38,284 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 20:12:38,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 08:12:38 BasicIcfg [2022-04-14 20:12:38,285 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 20:12:38,286 INFO L158 Benchmark]: Toolchain (without parser) took 24318.70ms. Allocated memory was 200.3MB in the beginning and 247.5MB in the end (delta: 47.2MB). Free memory was 149.9MB in the beginning and 210.2MB in the end (delta: -60.3MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:12:38,286 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 200.3MB. Free memory was 167.0MB in the beginning and 167.0MB in the end (delta: 72.7kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:12:38,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.04ms. Allocated memory is still 200.3MB. Free memory was 149.7MB in the beginning and 175.4MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 20:12:38,286 INFO L158 Benchmark]: Boogie Preprocessor took 21.25ms. Allocated memory is still 200.3MB. Free memory was 175.4MB in the beginning and 173.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 20:12:38,287 INFO L158 Benchmark]: RCFGBuilder took 236.04ms. Allocated memory is still 200.3MB. Free memory was 173.7MB in the beginning and 162.4MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-14 20:12:38,287 INFO L158 Benchmark]: IcfgTransformer took 22.97ms. Allocated memory is still 200.3MB. Free memory was 162.4MB in the beginning and 160.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-14 20:12:38,287 INFO L158 Benchmark]: TraceAbstraction took 23867.18ms. Allocated memory was 200.3MB in the beginning and 247.5MB in the end (delta: 47.2MB). Free memory was 160.0MB in the beginning and 210.2MB in the end (delta: -50.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 20:12:38,289 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.09ms. Allocated memory is still 200.3MB. Free memory was 167.0MB in the beginning and 167.0MB in the end (delta: 72.7kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 166.04ms. Allocated memory is still 200.3MB. Free memory was 149.7MB in the beginning and 175.4MB in the end (delta: -25.7MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 21.25ms. Allocated memory is still 200.3MB. Free memory was 175.4MB in the beginning and 173.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 236.04ms. Allocated memory is still 200.3MB. Free memory was 173.7MB in the beginning and 162.4MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 22.97ms. Allocated memory is still 200.3MB. Free memory was 162.4MB in the beginning and 160.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 23867.18ms. Allocated memory was 200.3MB in the beginning and 247.5MB in the end (delta: 47.2MB). Free memory was 160.0MB in the beginning and 210.2MB in the end (delta: -50.2MB). There was no memory consumed. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.8s, OverallIterations: 9, TraceHistogramMax: 7, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 94 mSDsluCounter, 999 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 688 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 580 IncrementalHoareTripleChecker+Invalid, 654 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 311 mSDtfsCounter, 580 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 498 GetRequests, 436 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 19 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 18.0s InterpolantComputationTime, 327 NumberOfCodeBlocks, 327 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 492 ConstructedInterpolants, 0 QuantifiedInterpolants, 1506 SizeOfPredicates, 16 NumberOfNonLiveVariables, 943 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 13 InterpolantComputations, 7 PerfectInterpolantSequences, 373/406 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-14 20:12:38,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...