/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/eca-rers2012/Problem10_label57.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 22:15:01,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 22:15:01,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 22:15:01,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 22:15:01,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 22:15:01,318 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 22:15:01,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 22:15:01,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 22:15:01,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 22:15:01,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 22:15:01,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 22:15:01,333 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 22:15:01,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 22:15:01,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 22:15:01,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 22:15:01,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 22:15:01,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 22:15:01,338 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 22:15:01,340 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 22:15:01,345 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 22:15:01,346 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 22:15:01,347 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 22:15:01,348 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 22:15:01,349 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 22:15:01,354 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 22:15:01,355 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 22:15:01,355 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 22:15:01,356 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 22:15:01,356 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 22:15:01,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 22:15:01,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 22:15:01,358 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 22:15:01,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 22:15:01,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 22:15:01,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 22:15:01,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 22:15:01,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 22:15:01,362 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 22:15:01,362 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 22:15:01,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 22:15:01,363 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 22:15:01,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-04-01 22:15:01,393 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 22:15:01,393 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 22:15:01,394 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 22:15:01,394 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 22:15:01,395 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 22:15:01,395 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 22:15:01,396 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-04-01 22:15:01,396 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-04-01 22:15:01,396 INFO L138 SettingsManager]: * Use SBE=true [2023-04-01 22:15:01,396 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 22:15:01,397 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 22:15:01,397 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 22:15:01,397 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 22:15:01,397 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 22:15:01,397 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 22:15:01,398 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 22:15:01,398 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 22:15:01,398 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 22:15:01,398 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 22:15:01,398 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 22:15:01,398 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 22:15:01,398 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 22:15:01,398 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-04-01 22:15:01,399 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 22:15:01,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 22:15:01,399 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 22:15:01,399 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 22:15:01,400 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 22:15:01,400 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-04-01 22:15:01,400 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 22:15:01,400 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-04-01 22:15:01,400 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 22:15:01,400 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-04-01 22:15:01,400 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-04-01 22:15:01,400 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-04-01 22:15:01,401 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-04-01 22:15:01,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 22:15:01,669 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 22:15:01,671 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 22:15:01,673 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 22:15:01,673 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 22:15:01,674 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem10_label57.c [2023-04-01 22:15:02,921 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 22:15:03,160 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 22:15:03,176 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label57.c [2023-04-01 22:15:03,189 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd23b59e7/bdab4825cdba488aa3fad8340a760fa8/FLAGb577be69f [2023-04-01 22:15:03,206 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd23b59e7/bdab4825cdba488aa3fad8340a760fa8 [2023-04-01 22:15:03,208 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 22:15:03,210 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 22:15:03,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 22:15:03,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 22:15:03,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 22:15:03,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,217 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6623669d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03, skipping insertion in model container [2023-04-01 22:15:03,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 22:15:03,273 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 22:15:03,447 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label57.c[986,999] [2023-04-01 22:15:03,642 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 22:15:03,654 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 22:15:03,666 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem10_label57.c[986,999] [2023-04-01 22:15:03,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 22:15:03,779 INFO L208 MainTranslator]: Completed translation [2023-04-01 22:15:03,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03 WrapperNode [2023-04-01 22:15:03,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 22:15:03,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 22:15:03,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 22:15:03,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 22:15:03,792 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,792 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,864 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,874 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 22:15:03,885 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 22:15:03,885 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 22:15:03,885 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 22:15:03,886 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (1/1) ... [2023-04-01 22:15:03,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 22:15:03,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:03,925 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) [2023-04-01 22:15:03,945 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 [2023-04-01 22:15:03,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 22:15:03,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 22:15:03,966 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 22:15:03,967 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2023-04-01 22:15:03,967 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 22:15:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2023-04-01 22:15:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 22:15:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 22:15:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 22:15:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 22:15:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-04-01 22:15:03,967 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-04-01 22:15:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 22:15:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 22:15:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 22:15:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 22:15:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 22:15:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 22:15:03,968 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 22:15:04,031 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 22:15:04,033 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 22:15:05,122 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 22:15:05,135 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 22:15:05,135 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-04-01 22:15:05,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:15:05 BoogieIcfgContainer [2023-04-01 22:15:05,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 22:15:05,141 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 22:15:05,141 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 22:15:05,144 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 22:15:05,144 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 10:15:03" (1/3) ... [2023-04-01 22:15:05,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655938b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:15:05, skipping insertion in model container [2023-04-01 22:15:05,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 10:15:03" (2/3) ... [2023-04-01 22:15:05,145 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655938b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 10:15:05, skipping insertion in model container [2023-04-01 22:15:05,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 10:15:05" (3/3) ... [2023-04-01 22:15:05,147 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label57.c [2023-04-01 22:15:05,163 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 22:15:05,163 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 22:15:05,224 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 22:15:05,230 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2787fdf4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-04-01 22:15:05,231 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 22:15:05,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 215 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 22:15:05,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-04-01 22:15:05,244 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:05,245 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:05,246 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:05,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash -585060775, now seen corresponding path program 1 times [2023-04-01 22:15:05,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:05,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210220564] [2023-04-01 22:15:05,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:05,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:05,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:05,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:05,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:05,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210220564] [2023-04-01 22:15:05,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210220564] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:05,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:15:05,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 22:15:05,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519930886] [2023-04-01 22:15:05,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:05,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-04-01 22:15:05,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:05,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-04-01 22:15:05,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-04-01 22:15:05,611 INFO L87 Difference]: Start difference. First operand has 215 states, 207 states have (on average 1.6763285024154588) internal successors, (347), 208 states have internal predecessors, (347), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 22:15:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:06,737 INFO L93 Difference]: Finished difference Result 596 states and 1021 transitions. [2023-04-01 22:15:06,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 22:15:06,739 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-04-01 22:15:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:06,757 INFO L225 Difference]: With dead ends: 596 [2023-04-01 22:15:06,757 INFO L226 Difference]: Without dead ends: 302 [2023-04-01 22:15:06,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-04-01 22:15:06,770 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 558 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:06,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 21 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-04-01 22:15:06,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-04-01 22:15:06,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2023-04-01 22:15:06,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 288 states have (on average 1.4548611111111112) internal successors, (419), 290 states have internal predecessors, (419), 4 states have call successors, (4), 4 states have call predecessors, (4), 5 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 22:15:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 430 transitions. [2023-04-01 22:15:06,849 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 430 transitions. Word has length 12 [2023-04-01 22:15:06,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:06,849 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 430 transitions. [2023-04-01 22:15:06,850 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 22:15:06,850 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 430 transitions. [2023-04-01 22:15:06,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-04-01 22:15:06,853 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:06,853 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:06,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 22:15:06,854 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:06,855 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:06,855 INFO L85 PathProgramCache]: Analyzing trace with hash 993424884, now seen corresponding path program 1 times [2023-04-01 22:15:06,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:06,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184584352] [2023-04-01 22:15:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:06,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:06,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:07,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:07,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:07,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:07,346 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:07,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:07,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184584352] [2023-04-01 22:15:07,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184584352] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:07,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:15:07,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-04-01 22:15:07,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827277695] [2023-04-01 22:15:07,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:07,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-04-01 22:15:07,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:07,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-04-01 22:15:07,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-04-01 22:15:07,350 INFO L87 Difference]: Start difference. First operand 298 states and 430 transitions. Second operand has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:08,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:08,250 INFO L93 Difference]: Finished difference Result 908 states and 1351 transitions. [2023-04-01 22:15:08,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 22:15:08,251 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 86 [2023-04-01 22:15:08,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:08,254 INFO L225 Difference]: With dead ends: 908 [2023-04-01 22:15:08,255 INFO L226 Difference]: Without dead ends: 616 [2023-04-01 22:15:08,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2023-04-01 22:15:08,257 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 751 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:08,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 51 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-04-01 22:15:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2023-04-01 22:15:08,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 596. [2023-04-01 22:15:08,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 576 states have (on average 1.296875) internal successors, (747), 584 states have internal predecessors, (747), 6 states have call successors, (6), 6 states have call predecessors, (6), 13 states have return successors, (29), 5 states have call predecessors, (29), 5 states have call successors, (29) [2023-04-01 22:15:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 782 transitions. [2023-04-01 22:15:08,299 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 782 transitions. Word has length 86 [2023-04-01 22:15:08,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:08,302 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 782 transitions. [2023-04-01 22:15:08,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.333333333333334) internal successors, (80), 4 states have internal predecessors, (80), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:08,303 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 782 transitions. [2023-04-01 22:15:08,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-04-01 22:15:08,305 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:08,305 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:08,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 22:15:08,306 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:08,306 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1683777305, now seen corresponding path program 1 times [2023-04-01 22:15:08,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828504453] [2023-04-01 22:15:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:08,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:08,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:08,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:08,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:08,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:08,560 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:08,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:08,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828504453] [2023-04-01 22:15:08,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828504453] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:08,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1731732024] [2023-04-01 22:15:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:08,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:08,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:08,569 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) [2023-04-01 22:15:08,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 22:15:08,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:08,704 INFO L262 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:08,709 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:08,760 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:15:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1731732024] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:08,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:15:08,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2023-04-01 22:15:08,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575632373] [2023-04-01 22:15:08,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:08,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:15:08,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:08,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:15:08,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 22:15:08,762 INFO L87 Difference]: Start difference. First operand 596 states and 782 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 22:15:09,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:09,260 INFO L93 Difference]: Finished difference Result 1480 states and 2020 transitions. [2023-04-01 22:15:09,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:15:09,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 91 [2023-04-01 22:15:09,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:09,265 INFO L225 Difference]: With dead ends: 1480 [2023-04-01 22:15:09,265 INFO L226 Difference]: Without dead ends: 890 [2023-04-01 22:15:09,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 22:15:09,268 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 152 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:09,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 67 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-04-01 22:15:09,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2023-04-01 22:15:09,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2023-04-01 22:15:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 862 states have (on average 1.28538283062645) internal successors, (1108), 874 states have internal predecessors, (1108), 8 states have call successors, (8), 8 states have call predecessors, (8), 19 states have return successors, (61), 7 states have call predecessors, (61), 7 states have call successors, (61) [2023-04-01 22:15:09,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1177 transitions. [2023-04-01 22:15:09,295 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1177 transitions. Word has length 91 [2023-04-01 22:15:09,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:09,296 INFO L495 AbstractCegarLoop]: Abstraction has 890 states and 1177 transitions. [2023-04-01 22:15:09,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 22:15:09,296 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1177 transitions. [2023-04-01 22:15:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-04-01 22:15:09,299 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:09,299 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:09,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:09,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:09,506 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:09,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:09,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1558783495, now seen corresponding path program 1 times [2023-04-01 22:15:09,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:09,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719746686] [2023-04-01 22:15:09,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:09,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:09,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:09,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:09,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:09,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:09,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:09,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719746686] [2023-04-01 22:15:09,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719746686] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:09,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 22:15:09,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-04-01 22:15:09,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483646107] [2023-04-01 22:15:09,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:09,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-04-01 22:15:09,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:09,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-04-01 22:15:09,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-04-01 22:15:09,848 INFO L87 Difference]: Start difference. First operand 890 states and 1177 transitions. Second operand has 8 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:10,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:10,609 INFO L93 Difference]: Finished difference Result 2404 states and 3305 transitions. [2023-04-01 22:15:10,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 22:15:10,609 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 107 [2023-04-01 22:15:10,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:10,617 INFO L225 Difference]: With dead ends: 2404 [2023-04-01 22:15:10,618 INFO L226 Difference]: Without dead ends: 1520 [2023-04-01 22:15:10,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-04-01 22:15:10,621 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 1107 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:10,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 38 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 656 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-04-01 22:15:10,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2023-04-01 22:15:10,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1341. [2023-04-01 22:15:10,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1341 states, 1296 states have (on average 1.1936728395061729) internal successors, (1547), 1319 states have internal predecessors, (1547), 11 states have call successors, (11), 11 states have call predecessors, (11), 33 states have return successors, (115), 10 states have call predecessors, (115), 10 states have call successors, (115) [2023-04-01 22:15:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1341 states to 1341 states and 1673 transitions. [2023-04-01 22:15:10,665 INFO L78 Accepts]: Start accepts. Automaton has 1341 states and 1673 transitions. Word has length 107 [2023-04-01 22:15:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:10,665 INFO L495 AbstractCegarLoop]: Abstraction has 1341 states and 1673 transitions. [2023-04-01 22:15:10,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.428571428571429) internal successors, (101), 5 states have internal predecessors, (101), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 22:15:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1341 states and 1673 transitions. [2023-04-01 22:15:10,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-04-01 22:15:10,667 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:10,667 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:10,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-04-01 22:15:10,668 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:10,668 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:10,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1677282008, now seen corresponding path program 1 times [2023-04-01 22:15:10,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:10,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418030294] [2023-04-01 22:15:10,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:10,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:10,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:10,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 22:15:10,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:10,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418030294] [2023-04-01 22:15:10,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418030294] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:10,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70558907] [2023-04-01 22:15:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:10,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:10,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:10,885 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) [2023-04-01 22:15:10,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 22:15:10,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:10,974 INFO L262 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:10,982 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:11,016 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:15:11,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70558907] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:11,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:15:11,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 7 [2023-04-01 22:15:11,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960328776] [2023-04-01 22:15:11,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:11,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:15:11,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:11,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:15:11,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-01 22:15:11,019 INFO L87 Difference]: Start difference. First operand 1341 states and 1673 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 22:15:11,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:11,480 INFO L93 Difference]: Finished difference Result 1923 states and 2438 transitions. [2023-04-01 22:15:11,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:15:11,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2023-04-01 22:15:11,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:11,488 INFO L225 Difference]: With dead ends: 1923 [2023-04-01 22:15:11,489 INFO L226 Difference]: Without dead ends: 1921 [2023-04-01 22:15:11,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-04-01 22:15:11,491 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 178 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:11,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 29 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 22:15:11,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2023-04-01 22:15:11,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1635. [2023-04-01 22:15:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1582 states have (on average 1.2029077117572693) internal successors, (1903), 1609 states have internal predecessors, (1903), 13 states have call successors, (13), 13 states have call predecessors, (13), 39 states have return successors, (163), 12 states have call predecessors, (163), 12 states have call successors, (163) [2023-04-01 22:15:11,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2079 transitions. [2023-04-01 22:15:11,537 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2079 transitions. Word has length 108 [2023-04-01 22:15:11,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:11,537 INFO L495 AbstractCegarLoop]: Abstraction has 1635 states and 2079 transitions. [2023-04-01 22:15:11,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-04-01 22:15:11,538 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2079 transitions. [2023-04-01 22:15:11,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2023-04-01 22:15:11,540 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:11,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:11,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:11,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:11,747 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:11,747 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:11,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1404266983, now seen corresponding path program 1 times [2023-04-01 22:15:11,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:11,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779839246] [2023-04-01 22:15:11,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:11,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:11,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:11,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:11,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:11,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2023-04-01 22:15:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:12,060 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 77 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 22:15:12,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:12,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779839246] [2023-04-01 22:15:12,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779839246] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:12,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098355976] [2023-04-01 22:15:12,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:12,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:12,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:12,062 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) [2023-04-01 22:15:12,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 22:15:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:12,170 INFO L262 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:12,173 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:12,333 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 78 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:12,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098355976] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:12,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:12,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 11 [2023-04-01 22:15:12,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4909868] [2023-04-01 22:15:12,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:12,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 22:15:12,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 22:15:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-04-01 22:15:12,765 INFO L87 Difference]: Start difference. First operand 1635 states and 2079 transitions. Second operand has 11 states, 11 states have (on average 33.09090909090909) internal successors, (364), 9 states have internal predecessors, (364), 4 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-01 22:15:14,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:14,280 INFO L93 Difference]: Finished difference Result 3743 states and 4887 transitions. [2023-04-01 22:15:14,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 22:15:14,281 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 33.09090909090909) internal successors, (364), 9 states have internal predecessors, (364), 4 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 180 [2023-04-01 22:15:14,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:14,289 INFO L225 Difference]: With dead ends: 3743 [2023-04-01 22:15:14,289 INFO L226 Difference]: Without dead ends: 2114 [2023-04-01 22:15:14,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 363 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2023-04-01 22:15:14,294 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 629 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 1749 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:14,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 122 Invalid, 1912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1749 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-04-01 22:15:14,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2023-04-01 22:15:14,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 1798. [2023-04-01 22:15:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1733 states have (on average 1.1909982688978649) internal successors, (2064), 1770 states have internal predecessors, (2064), 14 states have call successors, (14), 14 states have call predecessors, (14), 50 states have return successors, (195), 13 states have call predecessors, (195), 13 states have call successors, (195) [2023-04-01 22:15:14,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2273 transitions. [2023-04-01 22:15:14,345 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2273 transitions. Word has length 180 [2023-04-01 22:15:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:14,345 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 2273 transitions. [2023-04-01 22:15:14,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 33.09090909090909) internal successors, (364), 9 states have internal predecessors, (364), 4 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-01 22:15:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2273 transitions. [2023-04-01 22:15:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-04-01 22:15:14,348 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:14,348 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:14,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:14,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:14,555 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:14,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:14,556 INFO L85 PathProgramCache]: Analyzing trace with hash -905641757, now seen corresponding path program 1 times [2023-04-01 22:15:14,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:14,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248886721] [2023-04-01 22:15:14,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:14,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:14,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:14,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:14,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-04-01 22:15:15,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 10 proven. 85 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 22:15:15,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248886721] [2023-04-01 22:15:15,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248886721] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:15,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827154985] [2023-04-01 22:15:15,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:15,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:15,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:15,271 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) [2023-04-01 22:15:15,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 22:15:15,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:15,373 INFO L262 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:15,380 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2023-04-01 22:15:15,409 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:15:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827154985] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:15:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-04-01 22:15:15,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837497833] [2023-04-01 22:15:15,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:15,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:15:15,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:15,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:15:15,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-01 22:15:15,415 INFO L87 Difference]: Start difference. First operand 1798 states and 2273 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:15,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:15,893 INFO L93 Difference]: Finished difference Result 4607 states and 5930 transitions. [2023-04-01 22:15:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:15:15,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 198 [2023-04-01 22:15:15,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:15,907 INFO L225 Difference]: With dead ends: 4607 [2023-04-01 22:15:15,907 INFO L226 Difference]: Without dead ends: 2815 [2023-04-01 22:15:15,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 200 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-04-01 22:15:15,913 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 140 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:15,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 233 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 22:15:15,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2023-04-01 22:15:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2527. [2023-04-01 22:15:15,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2527 states, 2445 states have (on average 1.1578732106339469) internal successors, (2831), 2489 states have internal predecessors, (2831), 19 states have call successors, (19), 19 states have call predecessors, (19), 62 states have return successors, (269), 18 states have call predecessors, (269), 18 states have call successors, (269) [2023-04-01 22:15:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2527 states to 2527 states and 3119 transitions. [2023-04-01 22:15:15,994 INFO L78 Accepts]: Start accepts. Automaton has 2527 states and 3119 transitions. Word has length 198 [2023-04-01 22:15:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:15,994 INFO L495 AbstractCegarLoop]: Abstraction has 2527 states and 3119 transitions. [2023-04-01 22:15:15,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 2527 states and 3119 transitions. [2023-04-01 22:15:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-04-01 22:15:15,998 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:15,998 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:16,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:16,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:16,205 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:16,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:16,205 INFO L85 PathProgramCache]: Analyzing trace with hash -78299291, now seen corresponding path program 1 times [2023-04-01 22:15:16,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:16,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846128112] [2023-04-01 22:15:16,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:16,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:16,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:16,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:16,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:16,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-04-01 22:15:16,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 10 proven. 72 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 22:15:16,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:16,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846128112] [2023-04-01 22:15:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846128112] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:16,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889533000] [2023-04-01 22:15:16,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:16,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:16,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:16,810 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) [2023-04-01 22:15:16,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 22:15:16,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:16,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:16,917 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:16,938 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2023-04-01 22:15:16,938 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-04-01 22:15:16,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889533000] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 22:15:16,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-04-01 22:15:16,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2023-04-01 22:15:16,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059153493] [2023-04-01 22:15:16,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 22:15:16,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 22:15:16,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:16,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 22:15:16,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-04-01 22:15:16,941 INFO L87 Difference]: Start difference. First operand 2527 states and 3119 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:17,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:17,395 INFO L93 Difference]: Finished difference Result 5624 states and 7105 transitions. [2023-04-01 22:15:17,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 22:15:17,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 208 [2023-04-01 22:15:17,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:17,409 INFO L225 Difference]: With dead ends: 5624 [2023-04-01 22:15:17,409 INFO L226 Difference]: Without dead ends: 3103 [2023-04-01 22:15:17,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-04-01 22:15:17,415 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 162 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:17,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 34 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-04-01 22:15:17,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3103 states. [2023-04-01 22:15:17,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3103 to 2958. [2023-04-01 22:15:17,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2958 states, 2869 states have (on average 1.167654234925061) internal successors, (3350), 2914 states have internal predecessors, (3350), 22 states have call successors, (22), 22 states have call predecessors, (22), 66 states have return successors, (351), 21 states have call predecessors, (351), 21 states have call successors, (351) [2023-04-01 22:15:17,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3723 transitions. [2023-04-01 22:15:17,543 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3723 transitions. Word has length 208 [2023-04-01 22:15:17,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:17,543 INFO L495 AbstractCegarLoop]: Abstraction has 2958 states and 3723 transitions. [2023-04-01 22:15:17,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-04-01 22:15:17,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3723 transitions. [2023-04-01 22:15:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2023-04-01 22:15:17,550 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:17,550 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:17,559 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:17,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:17,757 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:17,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:17,758 INFO L85 PathProgramCache]: Analyzing trace with hash 2135048061, now seen corresponding path program 1 times [2023-04-01 22:15:17,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:17,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650579324] [2023-04-01 22:15:17,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:17,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:18,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-04-01 22:15:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 86 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 22:15:18,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:18,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650579324] [2023-04-01 22:15:18,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650579324] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:18,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349107735] [2023-04-01 22:15:18,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:18,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:18,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:18,313 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) [2023-04-01 22:15:18,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 22:15:18,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:18,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:18,421 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:18,622 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:18,623 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 87 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:19,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349107735] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:19,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 12 [2023-04-01 22:15:19,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473298506] [2023-04-01 22:15:19,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:19,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-04-01 22:15:19,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:19,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-04-01 22:15:19,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2023-04-01 22:15:19,103 INFO L87 Difference]: Start difference. First operand 2958 states and 3723 transitions. Second operand has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 10 states have internal predecessors, (506), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 22:15:20,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:20,827 INFO L93 Difference]: Finished difference Result 7785 states and 9697 transitions. [2023-04-01 22:15:20,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 22:15:20,828 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 10 states have internal predecessors, (506), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 232 [2023-04-01 22:15:20,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:20,840 INFO L225 Difference]: With dead ends: 7785 [2023-04-01 22:15:20,840 INFO L226 Difference]: Without dead ends: 3373 [2023-04-01 22:15:20,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 494 GetRequests, 470 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2023-04-01 22:15:20,847 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1332 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1833 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:20,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 60 Invalid, 2114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1833 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-04-01 22:15:20,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2023-04-01 22:15:20,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 2795. [2023-04-01 22:15:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2795 states, 2718 states have (on average 1.1269315673289184) internal successors, (3063), 2753 states have internal predecessors, (3063), 21 states have call successors, (21), 21 states have call predecessors, (21), 55 states have return successors, (246), 20 states have call predecessors, (246), 20 states have call successors, (246) [2023-04-01 22:15:20,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2795 states to 2795 states and 3330 transitions. [2023-04-01 22:15:20,920 INFO L78 Accepts]: Start accepts. Automaton has 2795 states and 3330 transitions. Word has length 232 [2023-04-01 22:15:20,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:20,921 INFO L495 AbstractCegarLoop]: Abstraction has 2795 states and 3330 transitions. [2023-04-01 22:15:20,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 42.166666666666664) internal successors, (506), 10 states have internal predecessors, (506), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2023-04-01 22:15:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 2795 states and 3330 transitions. [2023-04-01 22:15:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2023-04-01 22:15:20,927 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:20,927 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:20,936 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-04-01 22:15:21,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:21,133 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:21,134 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:21,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1955557838, now seen corresponding path program 1 times [2023-04-01 22:15:21,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:21,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270155683] [2023-04-01 22:15:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:21,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:21,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:21,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:21,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-04-01 22:15:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:21,847 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 10 proven. 91 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 22:15:21,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:21,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270155683] [2023-04-01 22:15:21,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270155683] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:21,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [717192159] [2023-04-01 22:15:21,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:21,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:21,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:21,849 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) [2023-04-01 22:15:21,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 22:15:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:21,956 INFO L262 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 4 conjunts are in the unsatisfiable core [2023-04-01 22:15:21,960 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:22,165 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 104 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:22,166 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:22,604 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 104 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:22,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [717192159] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 22:15:22,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 22:15:22,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2023-04-01 22:15:22,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333608916] [2023-04-01 22:15:22,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:22,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 22:15:22,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:22,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 22:15:22,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2023-04-01 22:15:22,607 INFO L87 Difference]: Start difference. First operand 2795 states and 3330 transitions. Second operand has 13 states, 13 states have (on average 40.38461538461539) internal successors, (525), 11 states have internal predecessors, (525), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 22:15:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:24,786 INFO L93 Difference]: Finished difference Result 5984 states and 7231 transitions. [2023-04-01 22:15:24,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-04-01 22:15:24,787 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 40.38461538461539) internal successors, (525), 11 states have internal predecessors, (525), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) Word has length 249 [2023-04-01 22:15:24,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:24,799 INFO L225 Difference]: With dead ends: 5984 [2023-04-01 22:15:24,799 INFO L226 Difference]: Without dead ends: 3195 [2023-04-01 22:15:24,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 515 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=230, Invalid=826, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 22:15:24,806 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 1932 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 2455 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1936 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 2455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:24,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1936 Valid, 122 Invalid, 2705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 2455 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-04-01 22:15:24,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3195 states. [2023-04-01 22:15:24,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3195 to 2948. [2023-04-01 22:15:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2948 states, 2864 states have (on average 1.0841480446927374) internal successors, (3105), 2904 states have internal predecessors, (3105), 22 states have call successors, (22), 22 states have call predecessors, (22), 61 states have return successors, (187), 21 states have call predecessors, (187), 21 states have call successors, (187) [2023-04-01 22:15:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2948 states to 2948 states and 3314 transitions. [2023-04-01 22:15:24,885 INFO L78 Accepts]: Start accepts. Automaton has 2948 states and 3314 transitions. Word has length 249 [2023-04-01 22:15:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:24,885 INFO L495 AbstractCegarLoop]: Abstraction has 2948 states and 3314 transitions. [2023-04-01 22:15:24,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 40.38461538461539) internal successors, (525), 11 states have internal predecessors, (525), 5 states have call successors, (10), 7 states have call predecessors, (10), 6 states have return successors, (8), 5 states have call predecessors, (8), 5 states have call successors, (8) [2023-04-01 22:15:24,886 INFO L276 IsEmpty]: Start isEmpty. Operand 2948 states and 3314 transitions. [2023-04-01 22:15:24,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2023-04-01 22:15:24,890 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:24,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:24,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:25,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:25,100 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:25,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1674891269, now seen corresponding path program 1 times [2023-04-01 22:15:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:25,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271005208] [2023-04-01 22:15:25,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:25,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:25,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-04-01 22:15:25,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:25,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-04-01 22:15:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:25,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-04-01 22:15:25,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2023-04-01 22:15:25,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-04-01 22:15:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271005208] [2023-04-01 22:15:25,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271005208] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:25,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1903938001] [2023-04-01 22:15:25,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:25,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 22:15:25,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 22:15:25,965 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) [2023-04-01 22:15:25,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 22:15:26,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 22:15:26,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 22:15:26,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 22:15:26,741 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 4 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 22:15:26,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 22:15:27,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1903938001] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 22:15:27,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-04-01 22:15:27,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-04-01 22:15:27,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146871228] [2023-04-01 22:15:27,460 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-04-01 22:15:27,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 22:15:27,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-04-01 22:15:27,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 22:15:27,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2023-04-01 22:15:27,462 INFO L87 Difference]: Start difference. First operand 2948 states and 3314 transitions. Second operand has 16 states, 16 states have (on average 19.0) internal successors, (304), 13 states have internal predecessors, (304), 7 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-04-01 22:15:30,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 22:15:30,640 INFO L93 Difference]: Finished difference Result 8572 states and 9893 transitions. [2023-04-01 22:15:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-04-01 22:15:30,641 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 19.0) internal successors, (304), 13 states have internal predecessors, (304), 7 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 268 [2023-04-01 22:15:30,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 22:15:30,662 INFO L225 Difference]: With dead ends: 8572 [2023-04-01 22:15:30,663 INFO L226 Difference]: Without dead ends: 5624 [2023-04-01 22:15:30,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=266, Invalid=664, Unknown=0, NotChecked=0, Total=930 [2023-04-01 22:15:30,670 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2650 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 2515 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2650 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 2921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 2515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2023-04-01 22:15:30,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2650 Valid, 113 Invalid, 2921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 2515 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2023-04-01 22:15:30,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5624 states. [2023-04-01 22:15:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5624 to 4710. [2023-04-01 22:15:30,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4710 states, 4579 states have (on average 1.0821139986896702) internal successors, (4955), 4642 states have internal predecessors, (4955), 34 states have call successors, (34), 34 states have call predecessors, (34), 96 states have return successors, (326), 33 states have call predecessors, (326), 33 states have call successors, (326) [2023-04-01 22:15:30,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 5315 transitions. [2023-04-01 22:15:30,799 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 5315 transitions. Word has length 268 [2023-04-01 22:15:30,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 22:15:30,799 INFO L495 AbstractCegarLoop]: Abstraction has 4710 states and 5315 transitions. [2023-04-01 22:15:30,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 19.0) internal successors, (304), 13 states have internal predecessors, (304), 7 states have call successors, (10), 9 states have call predecessors, (10), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-04-01 22:15:30,800 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 5315 transitions. [2023-04-01 22:15:30,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2023-04-01 22:15:30,806 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 22:15:30,807 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:30,815 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 22:15:31,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-01 22:15:31,018 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 22:15:31,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 22:15:31,018 INFO L85 PathProgramCache]: Analyzing trace with hash -990163934, now seen corresponding path program 1 times [2023-04-01 22:15:31,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-04-01 22:15:31,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556298477] [2023-04-01 22:15:31,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 22:15:31,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 22:15:31,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 22:15:31,070 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-04-01 22:15:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-04-01 22:15:31,199 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-04-01 22:15:31,199 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-04-01 22:15:31,200 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 22:15:31,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-04-01 22:15:31,207 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 22:15:31,211 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 22:15:31,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 10:15:31 BoogieIcfgContainer [2023-04-01 22:15:31,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 22:15:31,326 INFO L158 Benchmark]: Toolchain (without parser) took 28115.66ms. Allocated memory was 257.9MB in the beginning and 630.2MB in the end (delta: 372.2MB). Free memory was 209.1MB in the beginning and 564.9MB in the end (delta: -355.8MB). Peak memory consumption was 370.2MB. Max. memory is 8.0GB. [2023-04-01 22:15:31,326 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 175.1MB. Free memory was 124.7MB in the beginning and 124.5MB in the end (delta: 171.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 22:15:31,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.83ms. Allocated memory is still 257.9MB. Free memory was 209.1MB in the beginning and 181.4MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. [2023-04-01 22:15:31,326 INFO L158 Benchmark]: Boogie Preprocessor took 103.10ms. Allocated memory is still 257.9MB. Free memory was 181.4MB in the beginning and 177.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-04-01 22:15:31,326 INFO L158 Benchmark]: RCFGBuilder took 1253.62ms. Allocated memory is still 257.9MB. Free memory was 177.0MB in the beginning and 166.7MB in the end (delta: 10.3MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. [2023-04-01 22:15:31,327 INFO L158 Benchmark]: TraceAbstraction took 26184.18ms. Allocated memory was 257.9MB in the beginning and 630.2MB in the end (delta: 372.2MB). Free memory was 166.2MB in the beginning and 564.9MB in the end (delta: -398.8MB). Peak memory consumption was 326.9MB. Max. memory is 8.0GB. [2023-04-01 22:15:31,328 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 175.1MB. Free memory was 124.7MB in the beginning and 124.5MB in the end (delta: 171.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 567.83ms. Allocated memory is still 257.9MB. Free memory was 209.1MB in the beginning and 181.4MB in the end (delta: 27.7MB). Peak memory consumption was 27.3MB. Max. memory is 8.0GB. * Boogie Preprocessor took 103.10ms. Allocated memory is still 257.9MB. Free memory was 181.4MB in the beginning and 177.0MB in the end (delta: 4.4MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 1253.62ms. Allocated memory is still 257.9MB. Free memory was 177.0MB in the beginning and 166.7MB in the end (delta: 10.3MB). Peak memory consumption was 30.8MB. Max. memory is 8.0GB. * TraceAbstraction took 26184.18ms. Allocated memory was 257.9MB in the beginning and 630.2MB in the end (delta: 372.2MB). Free memory was 166.2MB in the beginning and 564.9MB in the end (delta: -398.8MB). Peak memory consumption was 326.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 32]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [\old(a1)=505243, \old(a10)=505240, \old(a12)=505242, \old(a19)=505236, \old(a4)=505241, \old(inputB)=505234, \old(inputC)=505237, \old(inputD)=505235, \old(inputE)=505244, \old(inputF)=505238, a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L436] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L437] a10 = 1 [L439] return 25; VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, \old(input)=3, \result=25, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=9, a1=505232, a4=14, calculate_output(input)=25, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, a10=1, a12=0, a19=9, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND TRUE ((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14))))) [L232] a19 = 10 [L234] return 25; VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=9, \old(input)=3, \result=25, a10=1, a12=0, a19=10, a1=505232, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=10, a1=505232, a4=14, calculate_output(input)=25, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L600] CALL, EXPR calculate_output(input) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND FALSE !((((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L470] COND FALSE !(((a19==9) && ((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3)) && (a10==1)) && (a12==0))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L475] COND FALSE !(((a10==0) && ((a12==0) && ((((input == 5) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a4==14))))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L481] COND FALSE !(( 218 < a1 && (((((input == 3) && (a10==1)) && (a12==0)) && (a4==14)) && (a19==10)))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L486] COND FALSE !((((a12==0) && ((a19==9) && (((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a4==14)))) && (a10==3))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L491] COND FALSE !((((((a4==14) && ( ((38 < a1) && (218 >= a1)) && (input == 2))) && (a12==0)) && (a10==1)) && (a19==10))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L497] COND FALSE !((((a19==10) && ((a10==1) && ((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (input == 5))))) && (a4==14))) VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, a10=1, a12=0, a19=10, a1=505232, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L503] COND TRUE ((((a10==1) && (((input == 5) && 218 < a1 ) && (a4==14))) && (a19==10)) && (a12==0)) [L504] a1 = (((((a1 % 89)- -93) * 5) % 89)- -56) [L505] a10 = 4 [L506] a19 = 8 [L508] return -1; VAL [\old(a1)=505232, \old(a10)=1, \old(a19)=10, \old(input)=5, \result=-1, a10=4, a12=0, a19=8, a1=60, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=4, a12=0, a19=8, a1=60, a4=14, calculate_output(input)=-1, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=25] [L600] output = calculate_output(input) [L592] COND TRUE 1 [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) VAL [\old(a1)=23, \old(a10)=0, \old(a19)=9, a10=4, a12=0, a19=8, a1=60, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6, output=-1] [L600] CALL calculate_output(input) VAL [\old(a1)=60, \old(a10)=4, \old(a19)=8, \old(input)=6, a10=4, a12=0, a19=8, a1=60, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L31] COND TRUE (((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8)) VAL [\old(a1)=60, \old(a10)=4, \old(a19)=8, \old(input)=6, a10=4, a12=0, a19=8, a1=60, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L32] reach_error() VAL [\old(a1)=60, \old(a10)=4, \old(a19)=8, \old(input)=6, a10=4, a12=0, a19=8, a1=60, a4=14, input=6, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 26.0s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9595 SdHoareTripleChecker+Valid, 10.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9591 mSDsluCounter, 890 SdHoareTripleChecker+Invalid, 9.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 452 mSDsCounter, 1764 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12035 IncrementalHoareTripleChecker+Invalid, 13799 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1764 mSolverCounterUnsat, 438 mSDtfsCounter, 12035 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2405 GetRequests, 2247 SyntacticMatches, 7 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 618 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4710occurred in iteration=11, InterpolantAutomatonStates: 122, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 2977 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.3s InterpolantComputationTime, 3599 NumberOfCodeBlocks, 3599 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 3912 ConstructedInterpolants, 8 QuantifiedInterpolants, 12836 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3058 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 22 InterpolantComputations, 7 PerfectInterpolantSequences, 1083/1479 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-04-01 22:15:31,352 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...