./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label45.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd7bfdc90ad274b856f062dcd9b414cf1c7c524311f5a91ee1cc532e8e6a452d --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-10 22:35:17,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-10 22:35:17,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-10 22:35:17,972 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-10 22:35:17,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-10 22:35:17,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-10 22:35:17,995 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-10 22:35:17,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-10 22:35:17,995 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-10 22:35:17,996 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-10 22:35:17,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-10 22:35:17,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-10 22:35:17,996 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-10 22:35:17,997 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-10 22:35:17,997 INFO L153 SettingsManager]: * Use SBE=true [2024-10-10 22:35:17,997 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-10 22:35:17,997 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-10 22:35:17,997 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-10 22:35:17,998 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-10 22:35:17,998 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-10 22:35:17,998 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-10 22:35:17,998 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-10 22:35:17,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-10 22:35:17,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-10 22:35:17,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-10 22:35:17,999 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-10 22:35:18,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-10 22:35:18,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-10 22:35:18,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-10 22:35:18,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-10 22:35:18,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-10 22:35:18,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-10 22:35:18,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:18,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-10 22:35:18,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-10 22:35:18,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-10 22:35:18,002 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-10 22:35:18,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-10 22:35:18,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-10 22:35:18,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-10 22:35:18,002 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-10 22:35:18,004 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-10 22:35:18,004 INFO L153 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-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd7bfdc90ad274b856f062dcd9b414cf1c7c524311f5a91ee1cc532e8e6a452d [2024-10-10 22:35:18,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-10 22:35:18,245 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-10 22:35:18,247 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-10 22:35:18,248 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-10 22:35:18,248 INFO L274 PluginConnector]: CDTParser initialized [2024-10-10 22:35:18,249 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label45.c [2024-10-10 22:35:19,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-10 22:35:19,722 INFO L384 CDTParser]: Found 1 translation units. [2024-10-10 22:35:19,725 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label45.c [2024-10-10 22:35:19,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c61e5d79a/d6d8c4da56b24e69957b74a12e6bf8d8/FLAGcd73b3f8d [2024-10-10 22:35:19,758 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/c61e5d79a/d6d8c4da56b24e69957b74a12e6bf8d8 [2024-10-10 22:35:19,761 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-10 22:35:19,762 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-10 22:35:19,763 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:19,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-10 22:35:19,768 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-10 22:35:19,769 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:19" (1/1) ... [2024-10-10 22:35:19,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7473005d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:19, skipping insertion in model container [2024-10-10 22:35:19,770 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 10:35:19" (1/1) ... [2024-10-10 22:35:19,810 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-10 22:35:20,068 WARN L248 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/Problem02_label45.c[14744,14757] [2024-10-10 22:35:20,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:20,129 INFO L200 MainTranslator]: Completed pre-run [2024-10-10 22:35:20,185 WARN L248 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/Problem02_label45.c[14744,14757] [2024-10-10 22:35:20,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-10 22:35:20,214 INFO L204 MainTranslator]: Completed translation [2024-10-10 22:35:20,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20 WrapperNode [2024-10-10 22:35:20,215 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-10 22:35:20,216 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:20,217 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-10 22:35:20,217 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-10 22:35:20,222 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,234 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,271 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-10-10 22:35:20,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-10 22:35:20,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-10 22:35:20,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-10 22:35:20,272 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-10 22:35:20,282 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,290 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,315 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-10 22:35:20,316 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,316 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,335 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-10 22:35:20,344 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-10 22:35:20,345 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-10 22:35:20,345 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-10 22:35:20,345 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (1/1) ... [2024-10-10 22:35:20,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-10 22:35:20,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:20,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-10 22:35:20,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-10 22:35:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-10 22:35:20,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-10 22:35:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-10 22:35:20,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-10 22:35:20,472 INFO L238 CfgBuilder]: Building ICFG [2024-10-10 22:35:20,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-10 22:35:21,207 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-10-10 22:35:21,207 INFO L287 CfgBuilder]: Performing block encoding [2024-10-10 22:35:21,248 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-10 22:35:21,249 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-10 22:35:21,249 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:21 BoogieIcfgContainer [2024-10-10 22:35:21,249 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-10 22:35:21,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-10 22:35:21,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-10 22:35:21,253 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-10 22:35:21,253 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 10:35:19" (1/3) ... [2024-10-10 22:35:21,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c7b93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:21, skipping insertion in model container [2024-10-10 22:35:21,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 10:35:20" (2/3) ... [2024-10-10 22:35:21,254 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70c7b93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 10:35:21, skipping insertion in model container [2024-10-10 22:35:21,254 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:21" (3/3) ... [2024-10-10 22:35:21,255 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label45.c [2024-10-10 22:35:21,267 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-10 22:35:21,267 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-10 22:35:21,316 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-10 22:35:21,321 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@53fcc404, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-10 22:35:21,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-10 22:35:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-10 22:35:21,333 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:21,333 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:21,334 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:21,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:21,338 INFO L85 PathProgramCache]: Analyzing trace with hash -661752826, now seen corresponding path program 1 times [2024-10-10 22:35:21,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:21,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532584992] [2024-10-10 22:35:21,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:21,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:21,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532584992] [2024-10-10 22:35:21,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532584992] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:21,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:21,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:21,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271141686] [2024-10-10 22:35:21,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:21,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:21,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:21,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:21,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:21,771 INFO L87 Difference]: Start difference. First operand has 165 states, 163 states have (on average 1.9202453987730062) internal successors, (313), 164 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:22,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:22,310 INFO L93 Difference]: Finished difference Result 485 states and 928 transitions. [2024-10-10 22:35:22,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:22,312 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2024-10-10 22:35:22,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:22,323 INFO L225 Difference]: With dead ends: 485 [2024-10-10 22:35:22,323 INFO L226 Difference]: Without dead ends: 317 [2024-10-10 22:35:22,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:22,329 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 96 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:22,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 100 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-10 22:35:22,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-10-10 22:35:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 312. [2024-10-10 22:35:22,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 311 states have (on average 1.472668810289389) internal successors, (458), 311 states have internal predecessors, (458), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:22,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 458 transitions. [2024-10-10 22:35:22,397 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 458 transitions. Word has length 81 [2024-10-10 22:35:22,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:22,397 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 458 transitions. [2024-10-10 22:35:22,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:22,398 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 458 transitions. [2024-10-10 22:35:22,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-10 22:35:22,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:22,400 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-10 22:35:22,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-10 22:35:22,401 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:22,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:22,401 INFO L85 PathProgramCache]: Analyzing trace with hash -239941071, now seen corresponding path program 1 times [2024-10-10 22:35:22,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:22,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499222797] [2024-10-10 22:35:22,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:22,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:22,636 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:22,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:22,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499222797] [2024-10-10 22:35:22,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499222797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:22,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:22,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:22,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882843144] [2024-10-10 22:35:22,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:22,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:22,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:22,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:22,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:22,641 INFO L87 Difference]: Start difference. First operand 312 states and 458 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:23,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:23,030 INFO L93 Difference]: Finished difference Result 909 states and 1340 transitions. [2024-10-10 22:35:23,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:23,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2024-10-10 22:35:23,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:23,034 INFO L225 Difference]: With dead ends: 909 [2024-10-10 22:35:23,034 INFO L226 Difference]: Without dead ends: 598 [2024-10-10 22:35:23,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:23,036 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 143 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:23,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 113 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-10 22:35:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-10-10 22:35:23,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2024-10-10 22:35:23,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.297979797979798) internal successors, (771), 594 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:23,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 771 transitions. [2024-10-10 22:35:23,067 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 771 transitions. Word has length 85 [2024-10-10 22:35:23,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:23,068 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 771 transitions. [2024-10-10 22:35:23,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 771 transitions. [2024-10-10 22:35:23,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-10 22:35:23,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:23,073 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:23,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-10 22:35:23,073 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:23,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:23,074 INFO L85 PathProgramCache]: Analyzing trace with hash 1941225258, now seen corresponding path program 1 times [2024-10-10 22:35:23,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:23,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757579266] [2024-10-10 22:35:23,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:23,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:23,212 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:23,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757579266] [2024-10-10 22:35:23,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757579266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:23,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:23,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229095334] [2024-10-10 22:35:23,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:23,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:23,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:23,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:23,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:23,214 INFO L87 Difference]: Start difference. First operand 595 states and 771 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:23,576 INFO L93 Difference]: Finished difference Result 1476 states and 1966 transitions. [2024-10-10 22:35:23,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:23,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-10 22:35:23,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:23,580 INFO L225 Difference]: With dead ends: 1476 [2024-10-10 22:35:23,580 INFO L226 Difference]: Without dead ends: 882 [2024-10-10 22:35:23,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:23,585 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 144 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:23,586 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 252 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:23,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2024-10-10 22:35:23,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 879. [2024-10-10 22:35:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 878 states have (on average 1.2357630979498861) internal successors, (1085), 878 states have internal predecessors, (1085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:23,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1085 transitions. [2024-10-10 22:35:23,599 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1085 transitions. Word has length 90 [2024-10-10 22:35:23,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:23,599 INFO L471 AbstractCegarLoop]: Abstraction has 879 states and 1085 transitions. [2024-10-10 22:35:23,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:23,600 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1085 transitions. [2024-10-10 22:35:23,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-10-10 22:35:23,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:23,602 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1] [2024-10-10 22:35:23,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-10 22:35:23,603 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:23,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:23,603 INFO L85 PathProgramCache]: Analyzing trace with hash -2016364043, now seen corresponding path program 1 times [2024-10-10 22:35:23,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:23,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393153582] [2024-10-10 22:35:23,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:23,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:23,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393153582] [2024-10-10 22:35:23,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393153582] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:35:23,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967073033] [2024-10-10 22:35:23,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:23,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:23,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:23,739 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:35:23,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-10 22:35:23,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:23,804 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:35:23,810 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:35:23,918 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:35:23,918 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:35:23,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967073033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:23,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:35:23,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-10-10 22:35:23,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877768766] [2024-10-10 22:35:23,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:23,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:23,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:23,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:23,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:35:23,920 INFO L87 Difference]: Start difference. First operand 879 states and 1085 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:24,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:24,272 INFO L93 Difference]: Finished difference Result 2334 states and 2919 transitions. [2024-10-10 22:35:24,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 90 [2024-10-10 22:35:24,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:24,277 INFO L225 Difference]: With dead ends: 2334 [2024-10-10 22:35:24,277 INFO L226 Difference]: Without dead ends: 1456 [2024-10-10 22:35:24,278 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-10 22:35:24,279 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 122 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:24,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 71 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2024-10-10 22:35:24,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1456. [2024-10-10 22:35:24,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1456 states, 1455 states have (on average 1.234364261168385) internal successors, (1796), 1455 states have internal predecessors, (1796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:24,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1456 states to 1456 states and 1796 transitions. [2024-10-10 22:35:24,303 INFO L78 Accepts]: Start accepts. Automaton has 1456 states and 1796 transitions. Word has length 90 [2024-10-10 22:35:24,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:24,304 INFO L471 AbstractCegarLoop]: Abstraction has 1456 states and 1796 transitions. [2024-10-10 22:35:24,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1456 states and 1796 transitions. [2024-10-10 22:35:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-10 22:35:24,306 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:24,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1] [2024-10-10 22:35:24,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-10 22:35:24,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:24,507 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:24,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:24,507 INFO L85 PathProgramCache]: Analyzing trace with hash 158498976, now seen corresponding path program 1 times [2024-10-10 22:35:24,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:24,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194977091] [2024-10-10 22:35:24,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:24,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:24,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:24,601 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:24,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:24,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194977091] [2024-10-10 22:35:24,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194977091] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:24,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:24,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:24,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505823364] [2024-10-10 22:35:24,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:24,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:24,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:24,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:24,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:24,603 INFO L87 Difference]: Start difference. First operand 1456 states and 1796 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:24,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:24,972 INFO L93 Difference]: Finished difference Result 3757 states and 4637 transitions. [2024-10-10 22:35:24,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:24,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2024-10-10 22:35:24,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:24,978 INFO L225 Difference]: With dead ends: 3757 [2024-10-10 22:35:24,979 INFO L226 Difference]: Without dead ends: 2302 [2024-10-10 22:35:24,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:24,981 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 143 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:24,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 267 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:24,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2302 states. [2024-10-10 22:35:25,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2302 to 2296. [2024-10-10 22:35:25,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2296 states, 2295 states have (on average 1.1790849673202615) internal successors, (2706), 2295 states have internal predecessors, (2706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:25,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 2706 transitions. [2024-10-10 22:35:25,015 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 2706 transitions. Word has length 94 [2024-10-10 22:35:25,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:25,015 INFO L471 AbstractCegarLoop]: Abstraction has 2296 states and 2706 transitions. [2024-10-10 22:35:25,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 2706 transitions. [2024-10-10 22:35:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-10 22:35:25,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:25,018 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:25,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-10 22:35:25,018 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:25,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:25,019 INFO L85 PathProgramCache]: Analyzing trace with hash 422153069, now seen corresponding path program 1 times [2024-10-10 22:35:25,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:25,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059290815] [2024-10-10 22:35:25,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:25,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:25,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:25,055 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:35:25,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:25,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059290815] [2024-10-10 22:35:25,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059290815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:25,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:25,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-10 22:35:25,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016612818] [2024-10-10 22:35:25,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:25,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:25,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:25,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:25,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:25,059 INFO L87 Difference]: Start difference. First operand 2296 states and 2706 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:25,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:25,442 INFO L93 Difference]: Finished difference Result 5570 states and 6666 transitions. [2024-10-10 22:35:25,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:25,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-10-10 22:35:25,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:25,450 INFO L225 Difference]: With dead ends: 5570 [2024-10-10 22:35:25,450 INFO L226 Difference]: Without dead ends: 3275 [2024-10-10 22:35:25,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:25,453 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 170 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:25,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 102 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3275 states. [2024-10-10 22:35:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3275 to 3275. [2024-10-10 22:35:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3275 states, 3274 states have (on average 1.163714111178986) internal successors, (3810), 3274 states have internal predecessors, (3810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:25,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3275 states to 3275 states and 3810 transitions. [2024-10-10 22:35:25,494 INFO L78 Accepts]: Start accepts. Automaton has 3275 states and 3810 transitions. Word has length 95 [2024-10-10 22:35:25,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:25,494 INFO L471 AbstractCegarLoop]: Abstraction has 3275 states and 3810 transitions. [2024-10-10 22:35:25,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:25,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3275 states and 3810 transitions. [2024-10-10 22:35:25,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-10 22:35:25,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:25,497 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2024-10-10 22:35:25,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-10 22:35:25,497 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:25,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:25,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1795908540, now seen corresponding path program 1 times [2024-10-10 22:35:25,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:25,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642664222] [2024-10-10 22:35:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:25,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:25,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:25,562 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-10 22:35:25,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:25,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642664222] [2024-10-10 22:35:25,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642664222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:25,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:25,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:25,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642749184] [2024-10-10 22:35:25,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:25,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:25,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:25,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:25,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:25,565 INFO L87 Difference]: Start difference. First operand 3275 states and 3810 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:25,906 INFO L93 Difference]: Finished difference Result 6551 states and 7622 transitions. [2024-10-10 22:35:25,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:25,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-10-10 22:35:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:25,914 INFO L225 Difference]: With dead ends: 6551 [2024-10-10 22:35:25,914 INFO L226 Difference]: Without dead ends: 3277 [2024-10-10 22:35:25,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:25,918 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 161 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:25,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 50 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:25,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3277 states. [2024-10-10 22:35:25,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3277 to 2995. [2024-10-10 22:35:25,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2995 states, 2994 states have (on average 1.1472945891783568) internal successors, (3435), 2994 states have internal predecessors, (3435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2995 states to 2995 states and 3435 transitions. [2024-10-10 22:35:25,987 INFO L78 Accepts]: Start accepts. Automaton has 2995 states and 3435 transitions. Word has length 114 [2024-10-10 22:35:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:25,987 INFO L471 AbstractCegarLoop]: Abstraction has 2995 states and 3435 transitions. [2024-10-10 22:35:25,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2995 states and 3435 transitions. [2024-10-10 22:35:25,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-10 22:35:25,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:25,990 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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] [2024-10-10 22:35:25,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-10 22:35:25,991 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:25,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:25,992 INFO L85 PathProgramCache]: Analyzing trace with hash -92015225, now seen corresponding path program 1 times [2024-10-10 22:35:25,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:25,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825634650] [2024-10-10 22:35:25,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:26,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:26,199 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:26,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:26,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825634650] [2024-10-10 22:35:26,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825634650] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:35:26,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134465493] [2024-10-10 22:35:26,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:26,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:26,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:26,201 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:35:26,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-10 22:35:26,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:26,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-10 22:35:26,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:35:26,395 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-10 22:35:26,396 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:35:26,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134465493] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:26,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:35:26,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:35:26,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7040775] [2024-10-10 22:35:26,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:26,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:26,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:26,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:26,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:26,398 INFO L87 Difference]: Start difference. First operand 2995 states and 3435 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:26,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:26,758 INFO L93 Difference]: Finished difference Result 5847 states and 6722 transitions. [2024-10-10 22:35:26,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:26,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2024-10-10 22:35:26,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:26,765 INFO L225 Difference]: With dead ends: 5847 [2024-10-10 22:35:26,765 INFO L226 Difference]: Without dead ends: 2853 [2024-10-10 22:35:26,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:26,768 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 84 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:26,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 245 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2853 states. [2024-10-10 22:35:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2853 to 2853. [2024-10-10 22:35:26,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2853 states, 2852 states have (on average 1.1044880785413744) internal successors, (3150), 2852 states have internal predecessors, (3150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:26,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2853 states to 2853 states and 3150 transitions. [2024-10-10 22:35:26,799 INFO L78 Accepts]: Start accepts. Automaton has 2853 states and 3150 transitions. Word has length 114 [2024-10-10 22:35:26,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:26,799 INFO L471 AbstractCegarLoop]: Abstraction has 2853 states and 3150 transitions. [2024-10-10 22:35:26,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:26,799 INFO L276 IsEmpty]: Start isEmpty. Operand 2853 states and 3150 transitions. [2024-10-10 22:35:26,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-10 22:35:26,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:26,801 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:26,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-10 22:35:27,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:27,006 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:27,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:27,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1527335340, now seen corresponding path program 1 times [2024-10-10 22:35:27,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:27,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77143528] [2024-10-10 22:35:27,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:27,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:27,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:27,074 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-10 22:35:27,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:27,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77143528] [2024-10-10 22:35:27,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77143528] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:27,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:27,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:27,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107056675] [2024-10-10 22:35:27,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:27,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:27,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:27,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:27,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:27,076 INFO L87 Difference]: Start difference. First operand 2853 states and 3150 transitions. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:27,433 INFO L93 Difference]: Finished difference Result 6263 states and 6973 transitions. [2024-10-10 22:35:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 115 [2024-10-10 22:35:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:27,441 INFO L225 Difference]: With dead ends: 6263 [2024-10-10 22:35:27,441 INFO L226 Difference]: Without dead ends: 3411 [2024-10-10 22:35:27,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:27,444 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 91 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:27,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 70 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:27,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3411 states. [2024-10-10 22:35:27,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3411 to 2986. [2024-10-10 22:35:27,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2986 states, 2985 states have (on average 1.1088777219430486) internal successors, (3310), 2985 states have internal predecessors, (3310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2986 states to 2986 states and 3310 transitions. [2024-10-10 22:35:27,482 INFO L78 Accepts]: Start accepts. Automaton has 2986 states and 3310 transitions. Word has length 115 [2024-10-10 22:35:27,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:27,482 INFO L471 AbstractCegarLoop]: Abstraction has 2986 states and 3310 transitions. [2024-10-10 22:35:27,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:27,482 INFO L276 IsEmpty]: Start isEmpty. Operand 2986 states and 3310 transitions. [2024-10-10 22:35:27,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-10 22:35:27,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:27,485 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:27,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-10 22:35:27,485 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:27,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:27,486 INFO L85 PathProgramCache]: Analyzing trace with hash -2055600413, now seen corresponding path program 1 times [2024-10-10 22:35:27,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:27,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936021493] [2024-10-10 22:35:27,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:27,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:27,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:27,659 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 60 proven. 8 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-10 22:35:27,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:27,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936021493] [2024-10-10 22:35:27,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936021493] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:35:27,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [707595280] [2024-10-10 22:35:27,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:27,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:27,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:27,661 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:35:27,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-10 22:35:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:27,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-10 22:35:27,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:35:27,756 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-10 22:35:27,756 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-10 22:35:27,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [707595280] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:27,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-10 22:35:27,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-10 22:35:27,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450368583] [2024-10-10 22:35:27,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:27,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:27,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:27,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:27,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:27,758 INFO L87 Difference]: Start difference. First operand 2986 states and 3310 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:28,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:28,078 INFO L93 Difference]: Finished difference Result 6115 states and 6791 transitions. [2024-10-10 22:35:28,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:28,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 134 [2024-10-10 22:35:28,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:28,085 INFO L225 Difference]: With dead ends: 6115 [2024-10-10 22:35:28,085 INFO L226 Difference]: Without dead ends: 3130 [2024-10-10 22:35:28,088 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-10 22:35:28,089 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 142 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:28,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 250 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 348 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3130 states. [2024-10-10 22:35:28,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3130 to 3121. [2024-10-10 22:35:28,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3121 states, 3120 states have (on average 1.083653846153846) internal successors, (3381), 3120 states have internal predecessors, (3381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3121 states to 3121 states and 3381 transitions. [2024-10-10 22:35:28,119 INFO L78 Accepts]: Start accepts. Automaton has 3121 states and 3381 transitions. Word has length 134 [2024-10-10 22:35:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:28,119 INFO L471 AbstractCegarLoop]: Abstraction has 3121 states and 3381 transitions. [2024-10-10 22:35:28,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3121 states and 3381 transitions. [2024-10-10 22:35:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-10 22:35:28,122 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:28,122 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:28,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-10 22:35:28,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:28,323 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:28,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:28,324 INFO L85 PathProgramCache]: Analyzing trace with hash -645824253, now seen corresponding path program 1 times [2024-10-10 22:35:28,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:28,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122956789] [2024-10-10 22:35:28,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:28,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:28,404 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-10 22:35:28,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:28,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122956789] [2024-10-10 22:35:28,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122956789] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:28,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:28,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:28,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48691757] [2024-10-10 22:35:28,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:28,406 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:28,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:28,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:28,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:28,407 INFO L87 Difference]: Start difference. First operand 3121 states and 3381 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:28,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:28,734 INFO L93 Difference]: Finished difference Result 6796 states and 7381 transitions. [2024-10-10 22:35:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:28,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-10-10 22:35:28,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:28,741 INFO L225 Difference]: With dead ends: 6796 [2024-10-10 22:35:28,741 INFO L226 Difference]: Without dead ends: 3676 [2024-10-10 22:35:28,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:28,744 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 139 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:28,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 192 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2024-10-10 22:35:28,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3674. [2024-10-10 22:35:28,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3674 states, 3673 states have (on average 1.0680642526545059) internal successors, (3923), 3673 states have internal predecessors, (3923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:28,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3674 states to 3674 states and 3923 transitions. [2024-10-10 22:35:28,775 INFO L78 Accepts]: Start accepts. Automaton has 3674 states and 3923 transitions. Word has length 163 [2024-10-10 22:35:28,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:28,775 INFO L471 AbstractCegarLoop]: Abstraction has 3674 states and 3923 transitions. [2024-10-10 22:35:28,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:28,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3674 states and 3923 transitions. [2024-10-10 22:35:28,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-10 22:35:28,779 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:28,779 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:28,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-10 22:35:28,779 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:28,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:28,779 INFO L85 PathProgramCache]: Analyzing trace with hash -929622685, now seen corresponding path program 1 times [2024-10-10 22:35:28,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:28,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044404696] [2024-10-10 22:35:28,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:28,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2024-10-10 22:35:28,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:28,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044404696] [2024-10-10 22:35:28,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044404696] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:28,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:28,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:28,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626113689] [2024-10-10 22:35:28,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:28,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:28,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:28,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:28,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:28,835 INFO L87 Difference]: Start difference. First operand 3674 states and 3923 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:29,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:29,156 INFO L93 Difference]: Finished difference Result 6635 states and 7086 transitions. [2024-10-10 22:35:29,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:29,159 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2024-10-10 22:35:29,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:29,165 INFO L225 Difference]: With dead ends: 6635 [2024-10-10 22:35:29,165 INFO L226 Difference]: Without dead ends: 2401 [2024-10-10 22:35:29,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:29,169 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 141 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:29,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 234 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-10 22:35:29,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states. [2024-10-10 22:35:29,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 2261. [2024-10-10 22:35:29,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2261 states, 2260 states have (on average 1.052212389380531) internal successors, (2378), 2260 states have internal predecessors, (2378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:29,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 2378 transitions. [2024-10-10 22:35:29,199 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 2378 transitions. Word has length 164 [2024-10-10 22:35:29,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:29,199 INFO L471 AbstractCegarLoop]: Abstraction has 2261 states and 2378 transitions. [2024-10-10 22:35:29,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:29,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 2378 transitions. [2024-10-10 22:35:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-10-10 22:35:29,202 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:29,203 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:29,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-10 22:35:29,203 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:29,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:29,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1124827846, now seen corresponding path program 1 times [2024-10-10 22:35:29,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:29,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032075485] [2024-10-10 22:35:29,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:29,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:29,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:29,450 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 135 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:29,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032075485] [2024-10-10 22:35:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032075485] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-10 22:35:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218937207] [2024-10-10 22:35:29,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:29,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-10 22:35:29,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-10 22:35:29,453 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-10 22:35:29,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-10 22:35:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:29,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-10 22:35:29,534 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-10 22:35:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 162 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:29,998 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-10 22:35:30,406 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 162 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-10 22:35:30,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218937207] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-10 22:35:30,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-10 22:35:30,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-10 22:35:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592684009] [2024-10-10 22:35:30,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-10 22:35:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-10 22:35:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-10 22:35:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-10 22:35:30,410 INFO L87 Difference]: Start difference. First operand 2261 states and 2378 transitions. Second operand has 10 states, 10 states have (on average 29.1) internal successors, (291), 9 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:31,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:31,908 INFO L93 Difference]: Finished difference Result 6227 states and 6556 transitions. [2024-10-10 22:35:31,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-10 22:35:31,909 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 29.1) internal successors, (291), 9 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2024-10-10 22:35:31,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:31,913 INFO L225 Difference]: With dead ends: 6227 [2024-10-10 22:35:31,913 INFO L226 Difference]: Without dead ends: 1840 [2024-10-10 22:35:31,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 367 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2024-10-10 22:35:31,916 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 1323 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2744 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 2744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:31,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 118 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 2744 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-10 22:35:31,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1840 states. [2024-10-10 22:35:31,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1840 to 1271. [2024-10-10 22:35:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 1.0275590551181102) internal successors, (1305), 1270 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1305 transitions. [2024-10-10 22:35:31,929 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1305 transitions. Word has length 186 [2024-10-10 22:35:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:31,929 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1305 transitions. [2024-10-10 22:35:31,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.1) internal successors, (291), 9 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:31,929 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1305 transitions. [2024-10-10 22:35:31,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2024-10-10 22:35:31,931 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:31,931 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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] [2024-10-10 22:35:31,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-10 22:35:32,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-10 22:35:32,132 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:32,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1462318907, now seen corresponding path program 1 times [2024-10-10 22:35:32,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:32,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034221788] [2024-10-10 22:35:32,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:32,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-10 22:35:32,312 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-10-10 22:35:32,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-10 22:35:32,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034221788] [2024-10-10 22:35:32,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034221788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-10 22:35:32,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-10 22:35:32,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-10 22:35:32,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802762418] [2024-10-10 22:35:32,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-10 22:35:32,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-10 22:35:32,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-10 22:35:32,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-10 22:35:32,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:32,315 INFO L87 Difference]: Start difference. First operand 1271 states and 1305 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-10 22:35:32,525 INFO L93 Difference]: Finished difference Result 2542 states and 2616 transitions. [2024-10-10 22:35:32,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-10 22:35:32,526 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 221 [2024-10-10 22:35:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-10 22:35:32,528 INFO L225 Difference]: With dead ends: 2542 [2024-10-10 22:35:32,528 INFO L226 Difference]: Without dead ends: 1412 [2024-10-10 22:35:32,529 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-10 22:35:32,529 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 125 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-10 22:35:32,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 34 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-10 22:35:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-10-10 22:35:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1271. [2024-10-10 22:35:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1270 states have (on average 1.0251968503937008) internal successors, (1302), 1270 states have internal predecessors, (1302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1302 transitions. [2024-10-10 22:35:32,546 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1302 transitions. Word has length 221 [2024-10-10 22:35:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-10 22:35:32,546 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1302 transitions. [2024-10-10 22:35:32,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-10 22:35:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1302 transitions. [2024-10-10 22:35:32,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-10 22:35:32,548 INFO L207 NwaCegarLoop]: Found error trace [2024-10-10 22:35:32,548 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 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] [2024-10-10 22:35:32,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-10 22:35:32,549 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-10 22:35:32,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-10 22:35:32,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2101599298, now seen corresponding path program 1 times [2024-10-10 22:35:32,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-10 22:35:32,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733877224] [2024-10-10 22:35:32,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-10 22:35:32,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-10 22:35:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:35:32,585 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-10 22:35:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-10 22:35:32,650 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-10 22:35:32,650 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-10 22:35:32,652 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-10 22:35:32,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-10 22:35:32,655 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-10 22:35:32,749 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-10 22:35:32,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 10:35:32 BoogieIcfgContainer [2024-10-10 22:35:32,751 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-10 22:35:32,752 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-10 22:35:32,752 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-10 22:35:32,752 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-10 22:35:32,753 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 10:35:21" (3/4) ... [2024-10-10 22:35:32,754 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-10 22:35:32,878 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-10 22:35:32,880 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-10 22:35:32,880 INFO L158 Benchmark]: Toolchain (without parser) took 13118.18ms. Allocated memory was 159.4MB in the beginning and 299.9MB in the end (delta: 140.5MB). Free memory was 120.3MB in the beginning and 249.0MB in the end (delta: -128.7MB). Peak memory consumption was 175.5MB. Max. memory is 16.1GB. [2024-10-10 22:35:32,880 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-10 22:35:32,880 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.07ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 92.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-10 22:35:32,880 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.46ms. Allocated memory is still 159.4MB. Free memory was 92.0MB in the beginning and 85.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:35:32,881 INFO L158 Benchmark]: Boogie Preprocessor took 71.63ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 80.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-10 22:35:32,881 INFO L158 Benchmark]: RCFGBuilder took 905.26ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 76.9MB in the end (delta: 3.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-10-10 22:35:32,881 INFO L158 Benchmark]: TraceAbstraction took 11500.77ms. Allocated memory was 159.4MB in the beginning and 299.9MB in the end (delta: 140.5MB). Free memory was 76.9MB in the beginning and 103.2MB in the end (delta: -26.2MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. [2024-10-10 22:35:32,881 INFO L158 Benchmark]: Witness Printer took 127.77ms. Allocated memory is still 299.9MB. Free memory was 103.2MB in the beginning and 249.0MB in the end (delta: -145.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-10 22:35:32,882 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 115.3MB. Free memory is still 88.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.07ms. Allocated memory is still 159.4MB. Free memory was 119.3MB in the beginning and 92.0MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.46ms. Allocated memory is still 159.4MB. Free memory was 92.0MB in the beginning and 85.7MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.63ms. Allocated memory is still 159.4MB. Free memory was 85.7MB in the beginning and 80.5MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 905.26ms. Allocated memory is still 159.4MB. Free memory was 80.5MB in the beginning and 76.9MB in the end (delta: 3.6MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11500.77ms. Allocated memory was 159.4MB in the beginning and 299.9MB in the end (delta: 140.5MB). Free memory was 76.9MB in the beginning and 103.2MB in the end (delta: -26.2MB). Peak memory consumption was 115.3MB. Max. memory is 16.1GB. * Witness Printer took 127.77ms. Allocated memory is still 299.9MB. Free memory was 103.2MB in the beginning and 249.0MB in the end (delta: -145.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * 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: 428]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int a= 1; [L18] int e= 5; [L19] int d= 4; [L20] int f= 6; [L21] int c= 3; [L24] int u = 21; [L25] int v = 22; [L26] int w = 23; [L27] int x = 24; [L28] int y = 25; [L29] int z = 26; [L32] int a25 = 0; [L33] int a11 = 0; [L34] int a28 = 7; [L35] int a19 = 1; [L36] int a21 = 1; [L37] int a17 = 8; [L613] int output = -1; VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=4, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND TRUE ((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1))) [L245] a28 = 9 [L246] return 23; VAL [\result=23, a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a11=0, a17=8, a19=1, a21=1, a25=0, a28=9, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND TRUE (((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1)) [L405] a19 = 0 [L406] a28 = 7 [L407] return 25; VAL [\result=25, a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL, EXPR calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a11=0, a17=8, a19=0, a21=1, a25=0, a28=7, a=1, c=3, d=4, e=5, f=6, input=3, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND TRUE ((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1)) [L159] a11 = 1 [L160] a19 = 1 [L161] a28 = 10 [L162] a25 = 1 [L163] return -1; VAL [\result=-1, a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L624] RET, EXPR calculate_output(input) [L624] output = calculate_output(input) [L616] COND TRUE 1 [L619] int input; [L620] input = __VERIFIER_nondet_int() [L621] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L624] CALL calculate_output(input) [L40] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L45] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L48] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L52] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L57] COND FALSE !(((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L60] COND FALSE !(((a19==1)&&(!(a25==1)&&((a21==1)&&((((input==1)&&(a17==8))&&!(a11==1))&&(a28==7)))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L64] COND FALSE !(((((!(a19==1)&&((input==1)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L69] COND FALSE !(((a19==1)&&(((((input==1)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1)))))&&(a11==1))&&(a21==1))&&(a17==9)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L75] COND FALSE !(((a19==1)&&(((a17==8)&&(((input==6)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))&&!(a11==1)))&&(a21==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L79] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==1)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9)))))&&!(a19==1))&&(a17==8)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L84] COND FALSE !((!(a19==1)&&(((((a17==8)&&((a25==1)&&(input==3)))&&(a28==10))&&!(a11==1))&&(a21==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L92] COND FALSE !((((!(a19==1)&&((a21==1)&&((((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||((a28==7)&&!(a25==1))))&&(input==4))))&&!(a11==1))&&(a17==8))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L101] COND FALSE !(((a17==8)&&((a21==1)&&((a25==1)&&((a19==1)&&(!(a11==1)&&((a28==11)&&(input==3)))))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L105] COND FALSE !(((a28==9)&&(((!(a19==1)&&(((input==3)&&!(a11==1))&&(a17==8)))&&!(a25==1))&&(a21==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L109] COND FALSE !(((!(a11==1)&&(((a28==11)&&((a25==1)&&((input==1)&&(a19==1))))&&(a17==8)))&&(a21==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L116] COND FALSE !((((a11==1)&&((((((a25==1)&&(a28==8))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7))))&&(input==6))&&(a19==1))&&(a17==9)))&&(a21==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L123] COND FALSE !(((a17==8)&&((a21==1)&&(!(a11==1)&&(!(a19==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L129] COND FALSE !((((((a21==1)&&((a28==10)&&((input==1)&&(a25==1))))&&!(a11==1))&&(a17==8))&&!(a19==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L133] COND FALSE !((!(a11==1)&&(!(a19==1)&&(((a17==8)&&((input==6)&&((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a28==8)&&(a25==1)))))&&(a21==1))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L140] COND FALSE !(((((a17==8)&&(!(a19==1)&&(((input==6)&&(a21==1))&&!(a25==1))))&&!(a11==1))&&(a28==9))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L144] COND FALSE !((!(a11==1)&&((!(a25==1)&&(((a21==1)&&((input==1)&&(a19==1)))&&(a17==8)))&&(a28==11)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L149] COND FALSE !((((a11==1)&&(((a19==1)&&((a21==1)&&(((a25==1)||!(a25==1))&&(input==4))))&&(a17==9)))&&(a28==9))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L153] COND FALSE !(((!(a11==1)&&((a28==9)&&(((!(a19==1)&&(input==5))&&!(a25==1))&&(a21==1))))&&(a17==8))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L158] COND FALSE !(((!(a11==1)&&(((a17==8)&&(((((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))||((a28==8)&&(a25==1)))&&(input==3)))&&!(a19==1)))&&(a21==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L164] COND FALSE !(((a21==1)&&(!(a19==1)&&((((input==5)&&(((a28==8)&&(a25==1))||(((a25==1)&&(a28==7))||(!(a25==1)&&(a28==7)))))&&!(a11==1))&&(a17==8))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L169] COND FALSE !((((a17==9)&&(((a28==8)&&(((input==1)&&(a19==1))&&!(a25==1)))&&(a11==1)))&&(a21==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L175] COND FALSE !((((a21==1)&&((a19==1)&&((a28==7)&&((a17==8)&&(!(a25==1)&&(input==3))))))&&!(a11==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L179] COND FALSE !(((a28==11)&&(((a17==8)&&((((input==6)&&(a21==1))&&(a19==1))&&!(a25==1)))&&!(a11==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L185] COND FALSE !(((!(a11==1)&&(((a17==8)&&((a21==1)&&((input==3)&&(a28==8))))&&(a19==1)))&&(a25==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L189] COND FALSE !((((a21==1)&&(((a19==1)&&(((((a25==1)&&(a28==7))||((a28==7)&&!(a25==1)))||((a25==1)&&(a28==8)))&&(input==4)))&&(a11==1)))&&(a17==9))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L195] COND FALSE !((((!(a11==1)&&((a17==8)&&(((input==4)&&(a19==1))&&(a28==8))))&&(a21==1))&&(a25==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L197] COND FALSE !(((a19==1)&&((((((input==4)&&(a21==1))&&(a28==9))&&!(a25==1))&&!(a11==1))&&(a17==8)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L199] COND FALSE !(((a17==8)&&((((((input==1)&&(a21==1))&&!(a11==1))&&(a19==1))&&!(a25==1))&&(a28==9)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L201] COND FALSE !((((((((input==4)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a21==1))&&(a17==8))&&(a28==10))&&(a19==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L204] COND FALSE !(((!(a25==1)&&((a11==1)&&((a28==8)&&(((a17==9)&&(input==4))&&(a19==1)))))&&(a21==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L208] COND FALSE !((!(a19==1)&&((a17==8)&&((a28==10)&&(((a25==1)&&(!(a11==1)&&(input==5)))&&(a21==1)))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L212] COND FALSE !((((((a21==1)&&((input==1)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))))&&(a17==8))&&!(a11==1))&&(a19==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L222] COND FALSE !(((a21==1)&&((((a19==1)&&((a25==1)&&((a28==11)&&(input==6))))&&!(a11==1))&&(a17==8)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L225] COND FALSE !((!(a11==1)&&((a19==1)&&((a28==10)&&(((((a25==1)||!(a25==1))&&(input==5))&&(a17==8))&&(a21==1)))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L228] COND FALSE !((((((a17==9)&&((((a25==1)||!(a25==1))&&(input==6))&&(a11==1)))&&(a19==1))&&(a21==1))&&(a28==9))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L233] COND FALSE !((((a17==8)&&(((((input==6)&&(a25==1))&&!(a19==1))&&!(a11==1))&&(a28==10)))&&(a21==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L235] COND FALSE !(((!(a19==1)&&((a17==8)&&(!(a11==1)&&((input==1)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))))&&(a21==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L242] COND FALSE !((((((((input==1)&&(a21==1))&&(a28==9))&&!(a19==1))&&!(a25==1))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L244] COND FALSE !(((a17==8)&&(((!(a11==1)&&((!(a25==1)&&(input==4))&&(a19==1)))&&(a28==7))&&(a21==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L247] COND FALSE !((!(a11==1)&&(((a17==8)&&((((!(a25==1)&&(a28==11))||((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1))))&&(input==3))&&(a21==1)))&&!(a19==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L258] COND FALSE !(((((!(a11==1)&&(((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==5)))&&(a21==1))&&!(a19==1))&&(a17==8))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L263] COND FALSE !((((a17==9)&&(((((input==1)&&((a25==1)||!(a25==1)))&&(a11==1))&&(a21==1))&&(a19==1)))&&(a28==9))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L269] COND FALSE !((!(a11==1)&&((a19==1)&&(((((a28==9)&&(input==6))&&(a21==1))&&(a17==8))&&!(a25==1))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L271] COND FALSE !(((a17==9)&&((a21==1)&&((a11==1)&&(((input==3)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a19==1)))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L286] COND FALSE !(((a28==7)&&((a17==8)&&(!(a25==1)&&((a21==1)&&((a19==1)&&((input==5)&&!(a11==1)))))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L290] COND FALSE !(((a28==8)&&((a21==1)&&((!(a11==1)&&(((input==1)&&(a17==8))&&(a19==1)))&&(a25==1))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L293] COND FALSE !((((((a17==8)&&(((input==6)&&((a25==1)||!(a25==1)))&&(a21==1)))&&(a28==10))&&!(a11==1))&&(a19==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L296] COND FALSE !(((!(a11==1)&&((!(a19==1)&&(((!(a25==1)&&(a28==11))||(((a28==10)&&!(a25==1))||((a25==1)&&(a28==11))))&&(input==5)))&&(a17==8)))&&(a21==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L301] COND FALSE !(((a17==8)&&(((a21==1)&&(!(a11==1)&&((a25==1)&&((a28==8)&&(input==6)))))&&(a19==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L303] COND FALSE !((((a19==1)&&((a17==8)&&(((!(a25==1)&&(input==5))&&(a21==1))&&!(a11==1))))&&(a28==11))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L307] COND FALSE !(((a11==1)&&(((a17==9)&&((a28==9)&&((a19==1)&&(((a25==1)||!(a25==1))&&(input==5)))))&&(a21==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L319] COND FALSE !((((((((input==3)&&(a19==1))&&(a21==1))&&(a17==8))&&!(a25==1))&&(a28==11))&&!(a11==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L324] COND FALSE !(((a19==1)&&((a21==1)&&((((input==5)&&(((a25==1)&&(a28==8))||(((a28==7)&&(a25==1))||(!(a25==1)&&(a28==7)))))&&(a11==1))&&(a17==9))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L338] COND FALSE !((((a19==1)&&(((!(a11==1)&&(((a25==1)||!(a25==1))&&(input==3)))&&(a28==10))&&(a21==1)))&&(a17==8))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L341] COND FALSE !(((!(a11==1)&&(((((input==4)&&(a17==8))&&!(a25==1))&&(a21==1))&&(a28==11)))&&(a19==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L347] COND FALSE !((((!(a19==1)&&(((input==4)&&(((!(a25==1)&&(a28==10))||((a28==11)&&(a25==1)))||(!(a25==1)&&(a28==11))))&&(a21==1)))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L359] COND FALSE !((!(a11==1)&&(((a17==8)&&((((a25==1)&&(input==4))&&(a19==1))&&(a28==11)))&&(a21==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L364] COND FALSE !((((((a21==1)&&((((a28==8)&&!(a25==1))||((a28==9)&&(a25==1)))&&(input==6)))&&!(a11==1))&&!(a19==1))&&(a17==8))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L371] COND FALSE !(((a19==1)&&((((a21==1)&&((!(a25==1)&&(input==3))&&(a17==9)))&&(a28==8))&&(a11==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L378] COND FALSE !(((a17==8)&&(((a21==1)&&(((input==5)&&((!(a25==1)&&(a28==8))||((a28==9)&&(a25==1))))&&(a19==1)))&&!(a11==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L385] COND FALSE !(((a19==1)&&(((((a17==8)&&((input==5)&&!(a11==1)))&&(a21==1))&&(a25==1))&&(a28==8)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L388] COND FALSE !((((!(a11==1)&&((((a21==1)&&(input==4))&&(a28==10))&&(a17==8)))&&!(a19==1))&&(a25==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L390] COND FALSE !(((a28==8)&&(((a19==1)&&((a11==1)&&(!(a25==1)&&((a17==9)&&(input==6)))))&&(a21==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L399] COND FALSE !((!(a11==1)&&((((a21==1)&&((input==6)&&((((a28==10)&&!(a25==1))||((a25==1)&&(a28==11)))||(!(a25==1)&&(a28==11)))))&&(a17==8))&&!(a19==1)))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L404] COND FALSE !((((((!(a25==1)&&((a19==1)&&(input==3)))&&(a28==9))&&(a21==1))&&(a17==8))&&!(a11==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L408] COND FALSE !((((a17==8)&&((((input==4)&&(((a28==8)&&!(a25==1))||((a25==1)&&(a28==9))))&&(a21==1))&&!(a19==1)))&&!(a11==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L412] COND FALSE !((((!(a11==1)&&((((a19==1)&&(input==5))&&(a17==8))&&(a21==1)))&&(a28==9))&&!(a25==1))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L414] COND FALSE !((((a11==1)&&((a19==1)&&((a21==1)&&(((a17==9)&&(input==5))&&!(a25==1)))))&&(a28==8))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L417] COND FALSE !((!(a11==1)&&((a21==1)&&(((a19==1)&&((a17==8)&&((a25==1)&&(input==5))))&&(a28==11))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, input=6, u=21, v=22, w=23, x=24, y=25, z=26] [L419] COND FALSE !(((a19==1)&&((a17==8)&&(((((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9)))&&(input==3))&&!(a11==1))&&(a21==1))))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L424] COND FALSE !((((((!(a25==1)&&(a11==1))&&(a28==7))&&!(a19==1))&&(a21==1))&&(a17==8))) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L427] COND TRUE ((((((a25==1)&&(a11==1))&&(a28==10))&&(a19==1))&&(a21==1))&&(a17==8)) VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] [L428] reach_error() VAL [a11=1, a17=8, a19=1, a21=1, a25=1, a28=10, a=1, c=3, d=4, e=5, f=6, u=21, v=22, w=23, x=24, y=25, z=26] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.4s, OverallIterations: 15, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3024 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3024 mSDsluCounter, 2098 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 290 mSDsCounter, 991 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7413 IncrementalHoareTripleChecker+Invalid, 8404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 991 mSolverCounterUnsat, 1808 mSDtfsCounter, 7413 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 759 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3674occurred in iteration=11, InterpolantAutomatonStates: 58, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1585 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 2498 NumberOfCodeBlocks, 2498 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 2437 ConstructedInterpolants, 0 QuantifiedInterpolants, 7679 SizeOfPredicates, 8 NumberOfNonLiveVariables, 1036 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 19 InterpolantComputations, 13 PerfectInterpolantSequences, 1349/1436 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! [2024-10-10 22:35:32,917 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE