./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label28.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB --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 bfdec3efb2e3689086e52b498036bfe20677fd5e46edd94f0588e543016085db --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 02:53:48,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 02:53:49,004 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-28 02:53:49,010 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 02:53:49,010 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 02:53:49,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 02:53:49,034 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 02:53:49,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 02:53:49,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 02:53:49,035 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 02:53:49,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 02:53:49,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 02:53:49,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 02:53:49,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 02:53:49,036 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 02:53:49,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 02:53:49,037 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-28 02:53:49,037 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 02:53:49,038 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 02:53:49,038 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 02:53:49,038 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 02:53:49,038 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-28 02:53:49,038 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 02:53:49,038 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-28 02:53:49,038 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 02:53:49,039 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-28 02:53:49,039 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 02:53:49,039 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 02:53:49,039 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 02:53:49,039 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:53:49,039 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:53:49,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:53:49,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:53:49,039 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 02:53:49,040 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 02:53:49,040 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 02:53:49,040 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 02:53:49,040 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:53:49,040 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 02:53:49,040 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 02:53:49,040 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-28 02:53:49,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-28 02:53:49,040 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 02:53:49,041 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 02:53:49,041 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 02:53:49,041 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 02:53:49,041 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 02:53:49,041 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 02:53:49,041 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB 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 -> bfdec3efb2e3689086e52b498036bfe20677fd5e46edd94f0588e543016085db [2024-11-28 02:53:49,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 02:53:49,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 02:53:49,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 02:53:49,357 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 02:53:49,357 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 02:53:49,359 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/eca-rers2012/Problem10_label28.c [2024-11-28 02:53:52,303 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/data/05291750d/5dee94886ec54cfaabb64a396b6886a1/FLAGee648fd46 [2024-11-28 02:53:52,703 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 02:53:52,704 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/sv-benchmarks/c/eca-rers2012/Problem10_label28.c [2024-11-28 02:53:52,722 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/data/05291750d/5dee94886ec54cfaabb64a396b6886a1/FLAGee648fd46 [2024-11-28 02:53:52,741 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/data/05291750d/5dee94886ec54cfaabb64a396b6886a1 [2024-11-28 02:53:52,744 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 02:53:52,748 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 02:53:52,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 02:53:52,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 02:53:52,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 02:53:52,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:52" (1/1) ... [2024-11-28 02:53:52,766 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0127e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:52, skipping insertion in model container [2024-11-28 02:53:52,766 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:53:52" (1/1) ... [2024-11-28 02:53:52,816 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 02:53:53,023 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/sv-benchmarks/c/eca-rers2012/Problem10_label28.c[1526,1539] [2024-11-28 02:53:53,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:53:53,211 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 02:53:53,224 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/sv-benchmarks/c/eca-rers2012/Problem10_label28.c[1526,1539] [2024-11-28 02:53:53,338 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 02:53:53,357 INFO L204 MainTranslator]: Completed translation [2024-11-28 02:53:53,358 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53 WrapperNode [2024-11-28 02:53:53,358 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 02:53:53,359 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 02:53:53,359 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 02:53:53,359 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 02:53:53,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,392 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,457 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 597 [2024-11-28 02:53:53,457 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 02:53:53,458 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 02:53:53,458 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 02:53:53,458 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 02:53:53,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,473 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,497 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-11-28 02:53:53,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,527 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,534 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 02:53:53,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 02:53:53,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 02:53:53,550 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 02:53:53,551 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (1/1) ... [2024-11-28 02:53:53,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 02:53:53,570 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:53:53,586 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 02:53:53,591 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 02:53:53,620 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 02:53:53,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 02:53:53,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 02:53:53,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 02:53:53,699 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 02:53:53,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 02:53:55,143 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-28 02:53:55,144 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 02:53:55,167 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 02:53:55,170 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-28 02:53:55,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:55 BoogieIcfgContainer [2024-11-28 02:53:55,171 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 02:53:55,174 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 02:53:55,175 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 02:53:55,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 02:53:55,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:53:52" (1/3) ... [2024-11-28 02:53:55,182 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2ee098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:55, skipping insertion in model container [2024-11-28 02:53:55,182 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:53:53" (2/3) ... [2024-11-28 02:53:55,183 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d2ee098 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:53:55, skipping insertion in model container [2024-11-28 02:53:55,183 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:55" (3/3) ... [2024-11-28 02:53:55,184 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem10_label28.c [2024-11-28 02:53:55,202 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 02:53:55,203 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem10_label28.c that has 1 procedures, 206 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-28 02:53:55,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 02:53:55,282 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;@242e807a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 02:53:55,282 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-28 02:53:55,287 INFO L276 IsEmpty]: Start isEmpty. Operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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-11-28 02:53:55,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 02:53:55,293 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:55,294 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:55,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:53:55,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -988188511, now seen corresponding path program 1 times [2024-11-28 02:53:55,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:55,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825514043] [2024-11-28 02:53:55,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:55,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:55,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:55,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825514043] [2024-11-28 02:53:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825514043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:55,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:55,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:55,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325881193] [2024-11-28 02:53:55,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:55,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:55,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:55,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:55,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:55,571 INFO L87 Difference]: Start difference. First operand has 206 states, 204 states have (on average 1.6862745098039216) internal successors, (344), 205 states have internal predecessors, (344), 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-11-28 02:53:56,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:56,597 INFO L93 Difference]: Finished difference Result 552 states and 966 transitions. [2024-11-28 02:53:56,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:56,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2024-11-28 02:53:56,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:56,610 INFO L225 Difference]: With dead ends: 552 [2024-11-28 02:53:56,610 INFO L226 Difference]: Without dead ends: 282 [2024-11-28 02:53:56,614 INFO L434 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-11-28 02:53:56,617 INFO L435 NwaCegarLoop]: 69 mSDtfsCounter, 177 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:56,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 76 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-28 02:53:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-28 02:53:56,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2024-11-28 02:53:56,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 281 states have internal predecessors, (432), 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-11-28 02:53:56,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2024-11-28 02:53:56,675 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 11 [2024-11-28 02:53:56,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:56,676 INFO L471 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2024-11-28 02:53:56,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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-11-28 02:53:56,676 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2024-11-28 02:53:56,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-28 02:53:56,678 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:56,679 INFO L218 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] [2024-11-28 02:53:56,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 02:53:56,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:53:56,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:56,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1081014105, now seen corresponding path program 1 times [2024-11-28 02:53:56,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:56,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926251461] [2024-11-28 02:53:56,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:56,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:57,354 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:57,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:57,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926251461] [2024-11-28 02:53:57,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926251461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:57,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:57,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954425462] [2024-11-28 02:53:57,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:57,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:57,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:57,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:57,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:57,360 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-11-28 02:53:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:58,077 INFO L93 Difference]: Finished difference Result 701 states and 1076 transitions. [2024-11-28 02:53:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:58,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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 80 [2024-11-28 02:53:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:58,081 INFO L225 Difference]: With dead ends: 701 [2024-11-28 02:53:58,081 INFO L226 Difference]: Without dead ends: 421 [2024-11-28 02:53:58,081 INFO L434 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-11-28 02:53:58,082 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 73 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:58,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-28 02:53:58,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-28 02:53:58,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-28 02:53:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 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-11-28 02:53:58,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2024-11-28 02:53:58,109 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 80 [2024-11-28 02:53:58,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:58,109 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2024-11-28 02:53:58,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 2 states have internal predecessors, (80), 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-11-28 02:53:58,110 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2024-11-28 02:53:58,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-28 02:53:58,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:58,112 INFO L218 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] [2024-11-28 02:53:58,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 02:53:58,112 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:53:58,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:58,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1549752968, now seen corresponding path program 1 times [2024-11-28 02:53:58,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:58,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419014595] [2024-11-28 02:53:58,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:58,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:58,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419014595] [2024-11-28 02:53:58,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419014595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:58,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:58,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:53:58,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810781] [2024-11-28 02:53:58,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:58,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:58,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:58,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:58,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:58,361 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-28 02:53:58,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:58,983 INFO L93 Difference]: Finished difference Result 562 states and 822 transitions. [2024-11-28 02:53:58,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:58,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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 86 [2024-11-28 02:53:58,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:58,987 INFO L225 Difference]: With dead ends: 562 [2024-11-28 02:53:58,987 INFO L226 Difference]: Without dead ends: 560 [2024-11-28 02:53:58,988 INFO L434 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-11-28 02:53:58,989 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 173 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 355 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 355 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:58,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 11 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 355 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:53:58,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-28 02:53:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2024-11-28 02:53:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 420 states have (on average 1.4428571428571428) internal successors, (606), 420 states have internal predecessors, (606), 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-11-28 02:53:59,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 606 transitions. [2024-11-28 02:53:59,014 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 606 transitions. Word has length 86 [2024-11-28 02:53:59,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:59,015 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 606 transitions. [2024-11-28 02:53:59,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 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-11-28 02:53:59,015 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 606 transitions. [2024-11-28 02:53:59,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-28 02:53:59,017 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:59,018 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:53:59,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 02:53:59,018 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:53:59,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:59,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1254754554, now seen corresponding path program 1 times [2024-11-28 02:53:59,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:59,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071742338] [2024-11-28 02:53:59,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:59,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:53:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:53:59,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:53:59,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071742338] [2024-11-28 02:53:59,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071742338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:53:59,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:53:59,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 02:53:59,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661960116] [2024-11-28 02:53:59,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:53:59,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:53:59,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:53:59,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:53:59,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:53:59,255 INFO L87 Difference]: Start difference. First operand 421 states and 606 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-11-28 02:53:59,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:53:59,881 INFO L93 Difference]: Finished difference Result 1118 states and 1639 transitions. [2024-11-28 02:53:59,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:53:59,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 105 [2024-11-28 02:53:59,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:53:59,885 INFO L225 Difference]: With dead ends: 1118 [2024-11-28 02:53:59,885 INFO L226 Difference]: Without dead ends: 699 [2024-11-28 02:53:59,886 INFO L434 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-11-28 02:53:59,887 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 51 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:53:59,888 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 77 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:53:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2024-11-28 02:53:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 560. [2024-11-28 02:53:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3237924865831843) internal successors, (740), 559 states have internal predecessors, (740), 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-11-28 02:53:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 740 transitions. [2024-11-28 02:53:59,908 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 740 transitions. Word has length 105 [2024-11-28 02:53:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:53:59,908 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 740 transitions. [2024-11-28 02:53:59,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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-11-28 02:53:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 740 transitions. [2024-11-28 02:53:59,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-28 02:53:59,912 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:53:59,913 INFO L218 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-28 02:53:59,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 02:53:59,913 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:53:59,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:53:59,913 INFO L85 PathProgramCache]: Analyzing trace with hash -645966282, now seen corresponding path program 1 times [2024-11-28 02:53:59,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:53:59,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15309511] [2024-11-28 02:53:59,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:53:59,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:53:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:00,405 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:54:00,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:00,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15309511] [2024-11-28 02:54:00,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15309511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:00,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:54:00,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:54:00,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009031740] [2024-11-28 02:54:00,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:00,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 02:54:00,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:00,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 02:54:00,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 02:54:00,410 INFO L87 Difference]: Start difference. First operand 560 states and 740 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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-11-28 02:54:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:01,098 INFO L93 Difference]: Finished difference Result 979 states and 1329 transitions. [2024-11-28 02:54:01,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 02:54:01,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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 129 [2024-11-28 02:54:01,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:01,103 INFO L225 Difference]: With dead ends: 979 [2024-11-28 02:54:01,103 INFO L226 Difference]: Without dead ends: 560 [2024-11-28 02:54:01,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 02:54:01,105 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 87 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:01,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 87 Invalid, 571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:54:01,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2024-11-28 02:54:01,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 560. [2024-11-28 02:54:01,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 559 states have (on average 1.3148479427549196) internal successors, (735), 559 states have internal predecessors, (735), 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-11-28 02:54:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 735 transitions. [2024-11-28 02:54:01,121 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 735 transitions. Word has length 129 [2024-11-28 02:54:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:01,122 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 735 transitions. [2024-11-28 02:54:01,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 3 states have internal predecessors, (129), 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-11-28 02:54:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 735 transitions. [2024-11-28 02:54:01,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-28 02:54:01,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:01,133 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-28 02:54:01,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 02:54:01,133 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:54:01,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:01,133 INFO L85 PathProgramCache]: Analyzing trace with hash -623288027, now seen corresponding path program 1 times [2024-11-28 02:54:01,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:01,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43667993] [2024-11-28 02:54:01,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:01,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:01,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 82 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:54:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:01,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43667993] [2024-11-28 02:54:01,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43667993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:01,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:54:01,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:54:01,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153279553] [2024-11-28 02:54:01,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:01,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:54:01,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:01,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:54:01,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:54:01,364 INFO L87 Difference]: Start difference. First operand 560 states and 735 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-11-28 02:54:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:01,980 INFO L93 Difference]: Finished difference Result 1257 states and 1753 transitions. [2024-11-28 02:54:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:54:01,981 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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 155 [2024-11-28 02:54:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:01,985 INFO L225 Difference]: With dead ends: 1257 [2024-11-28 02:54:01,985 INFO L226 Difference]: Without dead ends: 838 [2024-11-28 02:54:01,990 INFO L434 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-11-28 02:54:01,991 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 67 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:01,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 214 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:54:01,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-28 02:54:02,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-28 02:54:02,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2353643966547192) internal successors, (1034), 837 states have internal predecessors, (1034), 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-11-28 02:54:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1034 transitions. [2024-11-28 02:54:02,038 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1034 transitions. Word has length 155 [2024-11-28 02:54:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:02,038 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1034 transitions. [2024-11-28 02:54:02,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 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-11-28 02:54:02,039 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1034 transitions. [2024-11-28 02:54:02,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-28 02:54:02,041 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:02,041 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-28 02:54:02,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 02:54:02,041 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:54:02,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:02,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1357757561, now seen corresponding path program 1 times [2024-11-28 02:54:02,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:02,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133928192] [2024-11-28 02:54:02,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:02,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:02,537 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:54:02,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:02,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133928192] [2024-11-28 02:54:02,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133928192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:02,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:54:02,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 02:54:02,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115266294] [2024-11-28 02:54:02,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:02,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 02:54:02,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:02,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 02:54:02,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:54:02,541 INFO L87 Difference]: Start difference. First operand 838 states and 1034 transitions. Second operand has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 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-11-28 02:54:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:03,223 INFO L93 Difference]: Finished difference Result 1590 states and 1977 transitions. [2024-11-28 02:54:03,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 02:54:03,224 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 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-11-28 02:54:03,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:03,227 INFO L225 Difference]: With dead ends: 1590 [2024-11-28 02:54:03,227 INFO L226 Difference]: Without dead ends: 838 [2024-11-28 02:54:03,228 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:54:03,229 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 142 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:03,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 25 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:54:03,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2024-11-28 02:54:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2024-11-28 02:54:03,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 837 states have (on average 1.2305854241338112) internal successors, (1030), 837 states have internal predecessors, (1030), 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-11-28 02:54:03,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1030 transitions. [2024-11-28 02:54:03,251 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1030 transitions. Word has length 164 [2024-11-28 02:54:03,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:03,252 INFO L471 AbstractCegarLoop]: Abstraction has 838 states and 1030 transitions. [2024-11-28 02:54:03,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 23.428571428571427) internal successors, (164), 6 states have internal predecessors, (164), 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-11-28 02:54:03,252 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1030 transitions. [2024-11-28 02:54:03,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-28 02:54:03,254 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:03,254 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-28 02:54:03,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 02:54:03,254 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:54:03,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:03,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2017622509, now seen corresponding path program 1 times [2024-11-28 02:54:03,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:03,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572974684] [2024-11-28 02:54:03,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:03,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:03,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:54:03,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572974684] [2024-11-28 02:54:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572974684] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:03,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:54:03,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:54:03,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430832373] [2024-11-28 02:54:03,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:03,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:54:03,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:03,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:54:03,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:54:03,502 INFO L87 Difference]: Start difference. First operand 838 states and 1030 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-11-28 02:54:04,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:04,089 INFO L93 Difference]: Finished difference Result 1813 states and 2342 transitions. [2024-11-28 02:54:04,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:54:04,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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 200 [2024-11-28 02:54:04,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:04,094 INFO L225 Difference]: With dead ends: 1813 [2024-11-28 02:54:04,094 INFO L226 Difference]: Without dead ends: 1116 [2024-11-28 02:54:04,095 INFO L434 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-11-28 02:54:04,096 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 75 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:04,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 190 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:54:04,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2024-11-28 02:54:04,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2024-11-28 02:54:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 977 states, 976 states have (on average 1.2336065573770492) internal successors, (1204), 976 states have internal predecessors, (1204), 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-11-28 02:54:04,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1204 transitions. [2024-11-28 02:54:04,122 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1204 transitions. Word has length 200 [2024-11-28 02:54:04,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:04,123 INFO L471 AbstractCegarLoop]: Abstraction has 977 states and 1204 transitions. [2024-11-28 02:54:04,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 3 states have internal predecessors, (200), 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-11-28 02:54:04,123 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1204 transitions. [2024-11-28 02:54:04,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-28 02:54:04,127 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:04,127 INFO L218 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-28 02:54:04,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 02:54:04,127 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:54:04,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:04,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1025371890, now seen corresponding path program 1 times [2024-11-28 02:54:04,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:04,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339879672] [2024-11-28 02:54:04,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:04,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:04,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:04,758 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 32 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 02:54:04,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:04,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339879672] [2024-11-28 02:54:04,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339879672] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 02:54:04,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756112716] [2024-11-28 02:54:04,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:04,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 02:54:04,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 02:54:04,765 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 02:54:04,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 02:54:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:04,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-28 02:54:04,920 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 02:54:05,358 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2024-11-28 02:54:05,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-28 02:54:05,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1756112716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:05,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-28 02:54:05,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-28 02:54:05,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892255989] [2024-11-28 02:54:05,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:05,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:54:05,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:05,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:54:05,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:54:05,361 INFO L87 Difference]: Start difference. First operand 977 states and 1204 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-11-28 02:54:05,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:05,943 INFO L93 Difference]: Finished difference Result 2091 states and 2595 transitions. [2024-11-28 02:54:05,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:54:05,943 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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 238 [2024-11-28 02:54:05,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:05,948 INFO L225 Difference]: With dead ends: 2091 [2024-11-28 02:54:05,948 INFO L226 Difference]: Without dead ends: 1255 [2024-11-28 02:54:05,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-28 02:54:05,950 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 60 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:05,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 34 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:54:05,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2024-11-28 02:54:05,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2024-11-28 02:54:05,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 1.161084529505582) internal successors, (1456), 1254 states have internal predecessors, (1456), 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-11-28 02:54:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1456 transitions. [2024-11-28 02:54:05,982 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1456 transitions. Word has length 238 [2024-11-28 02:54:05,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:05,985 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1456 transitions. [2024-11-28 02:54:05,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 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-11-28 02:54:05,986 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1456 transitions. [2024-11-28 02:54:05,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2024-11-28 02:54:05,991 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:05,991 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-11-28 02:54:06,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 02:54:06,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-28 02:54:06,192 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:54:06,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:06,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1432200997, now seen corresponding path program 1 times [2024-11-28 02:54:06,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:06,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822956644] [2024-11-28 02:54:06,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:06,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:06,569 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2024-11-28 02:54:06,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:06,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822956644] [2024-11-28 02:54:06,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822956644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:06,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:54:06,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:54:06,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531582760] [2024-11-28 02:54:06,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:06,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:54:06,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:06,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:54:06,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:54:06,571 INFO L87 Difference]: Start difference. First operand 1255 states and 1456 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-11-28 02:54:07,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:07,213 INFO L93 Difference]: Finished difference Result 3203 states and 3730 transitions. [2024-11-28 02:54:07,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:54:07,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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 289 [2024-11-28 02:54:07,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:07,220 INFO L225 Difference]: With dead ends: 3203 [2024-11-28 02:54:07,221 INFO L226 Difference]: Without dead ends: 2089 [2024-11-28 02:54:07,222 INFO L434 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-11-28 02:54:07,223 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 135 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:07,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 195 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:54:07,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2024-11-28 02:54:07,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1672. [2024-11-28 02:54:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1671 states have (on average 1.168162776780371) internal successors, (1952), 1671 states have internal predecessors, (1952), 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-11-28 02:54:07,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1952 transitions. [2024-11-28 02:54:07,273 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1952 transitions. Word has length 289 [2024-11-28 02:54:07,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:07,274 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 1952 transitions. [2024-11-28 02:54:07,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 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-11-28 02:54:07,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1952 transitions. [2024-11-28 02:54:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2024-11-28 02:54:07,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:07,280 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:54:07,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 02:54:07,281 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:54:07,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash -490183734, now seen corresponding path program 1 times [2024-11-28 02:54:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897676021] [2024-11-28 02:54:07,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:07,571 INFO L134 CoverageAnalysis]: Checked inductivity of 271 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2024-11-28 02:54:07,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:07,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897676021] [2024-11-28 02:54:07,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897676021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:07,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:54:07,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:54:07,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344009753] [2024-11-28 02:54:07,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:07,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:54:07,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:07,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:54:07,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:54:07,575 INFO L87 Difference]: Start difference. First operand 1672 states and 1952 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-11-28 02:54:08,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:08,219 INFO L93 Difference]: Finished difference Result 3898 states and 4557 transitions. [2024-11-28 02:54:08,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:54:08,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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 306 [2024-11-28 02:54:08,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:08,228 INFO L225 Difference]: With dead ends: 3898 [2024-11-28 02:54:08,229 INFO L226 Difference]: Without dead ends: 2367 [2024-11-28 02:54:08,231 INFO L434 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-11-28 02:54:08,232 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:08,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 205 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-28 02:54:08,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2024-11-28 02:54:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 2367. [2024-11-28 02:54:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2367 states, 2366 states have (on average 1.1462383770076077) internal successors, (2712), 2366 states have internal predecessors, (2712), 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-11-28 02:54:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2712 transitions. [2024-11-28 02:54:08,297 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2712 transitions. Word has length 306 [2024-11-28 02:54:08,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:08,298 INFO L471 AbstractCegarLoop]: Abstraction has 2367 states and 2712 transitions. [2024-11-28 02:54:08,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 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-11-28 02:54:08,298 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2712 transitions. [2024-11-28 02:54:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2024-11-28 02:54:08,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:08,304 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:54:08,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 02:54:08,306 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:54:08,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:08,306 INFO L85 PathProgramCache]: Analyzing trace with hash -230704853, now seen corresponding path program 1 times [2024-11-28 02:54:08,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:08,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862231742] [2024-11-28 02:54:08,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:08,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 02:54:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2024-11-28 02:54:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 02:54:08,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862231742] [2024-11-28 02:54:08,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862231742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 02:54:08,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 02:54:08,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 02:54:08,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5609739] [2024-11-28 02:54:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 02:54:08,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 02:54:08,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 02:54:08,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 02:54:08,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 02:54:08,598 INFO L87 Difference]: Start difference. First operand 2367 states and 2712 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-11-28 02:54:09,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 02:54:09,196 INFO L93 Difference]: Finished difference Result 4732 states and 5427 transitions. [2024-11-28 02:54:09,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 02:54:09,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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 310 [2024-11-28 02:54:09,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 02:54:09,205 INFO L225 Difference]: With dead ends: 4732 [2024-11-28 02:54:09,205 INFO L226 Difference]: Without dead ends: 2228 [2024-11-28 02:54:09,208 INFO L434 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-11-28 02:54:09,209 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 131 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-28 02:54:09,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 225 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-28 02:54:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-28 02:54:09,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2228. [2024-11-28 02:54:09,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2228 states, 2227 states have (on average 1.1302200269420746) internal successors, (2517), 2227 states have internal predecessors, (2517), 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-11-28 02:54:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2228 states to 2228 states and 2517 transitions. [2024-11-28 02:54:09,292 INFO L78 Accepts]: Start accepts. Automaton has 2228 states and 2517 transitions. Word has length 310 [2024-11-28 02:54:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 02:54:09,292 INFO L471 AbstractCegarLoop]: Abstraction has 2228 states and 2517 transitions. [2024-11-28 02:54:09,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 3 states have internal predecessors, (129), 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-11-28 02:54:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2228 states and 2517 transitions. [2024-11-28 02:54:09,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2024-11-28 02:54:09,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 02:54:09,301 INFO L218 NwaCegarLoop]: trace histogram [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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:54:09,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 02:54:09,302 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-28 02:54:09,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 02:54:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash -2098557402, now seen corresponding path program 1 times [2024-11-28 02:54:09,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 02:54:09,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490636725] [2024-11-28 02:54:09,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 02:54:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 02:54:09,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:54:09,452 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 02:54:09,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 02:54:09,620 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 02:54:09,621 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 02:54:09,622 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-28 02:54:09,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 02:54:09,628 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 02:54:09,795 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 02:54:09,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 02:54:09 BoogieIcfgContainer [2024-11-28 02:54:09,798 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 02:54:09,799 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 02:54:09,799 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 02:54:09,799 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 02:54:09,800 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:53:55" (3/4) ... [2024-11-28 02:54:09,801 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 02:54:10,018 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 317. [2024-11-28 02:54:10,191 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 02:54:10,191 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 02:54:10,192 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 02:54:10,193 INFO L158 Benchmark]: Toolchain (without parser) took 17446.74ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 92.2MB in the beginning and 259.6MB in the end (delta: -167.3MB). Peak memory consumption was 138.6MB. Max. memory is 16.1GB. [2024-11-28 02:54:10,193 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 02:54:10,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 608.75ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 64.5MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-28 02:54:10,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 98.43ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 56.9MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:54:10,194 INFO L158 Benchmark]: Boogie Preprocessor took 91.04ms. Allocated memory is still 117.4MB. Free memory was 56.9MB in the beginning and 47.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 02:54:10,194 INFO L158 Benchmark]: RCFGBuilder took 1621.50ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 47.3MB in the beginning and 289.6MB in the end (delta: -242.3MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2024-11-28 02:54:10,194 INFO L158 Benchmark]: TraceAbstraction took 14624.16ms. Allocated memory was 352.3MB in the beginning and 427.8MB in the end (delta: 75.5MB). Free memory was 288.9MB in the beginning and 297.3MB in the end (delta: -8.4MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. [2024-11-28 02:54:10,195 INFO L158 Benchmark]: Witness Printer took 392.68ms. Allocated memory is still 427.8MB. Free memory was 297.3MB in the beginning and 259.6MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-28 02:54:10,196 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.34ms. Allocated memory is still 167.8MB. Free memory is still 103.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 608.75ms. Allocated memory is still 117.4MB. Free memory was 91.9MB in the beginning and 64.5MB in the end (delta: 27.3MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 98.43ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 56.9MB in the end (delta: 7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.04ms. Allocated memory is still 117.4MB. Free memory was 56.9MB in the beginning and 47.3MB in the end (delta: 9.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1621.50ms. Allocated memory was 117.4MB in the beginning and 352.3MB in the end (delta: 234.9MB). Free memory was 47.3MB in the beginning and 289.6MB in the end (delta: -242.3MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. * TraceAbstraction took 14624.16ms. Allocated memory was 352.3MB in the beginning and 427.8MB in the end (delta: 75.5MB). Free memory was 288.9MB in the beginning and 297.3MB in the end (delta: -8.4MB). Peak memory consumption was 68.2MB. Max. memory is 16.1GB. * Witness Printer took 392.68ms. Allocated memory is still 427.8MB. Free memory was 297.3MB in the beginning and 259.6MB in the end (delta: 37.7MB). Peak memory consumption was 33.6MB. 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: 47]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int inputC = 3; [L18] int inputD = 4; [L19] int inputE = 5; [L20] int inputF = 6; [L21] int inputB = 2; [L24] int a1 = 23; [L25] int a19 = 9; [L26] int a10 = 0; [L27] int a12 = 0; [L28] int a4 = 14; VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L589] int output = -1; VAL [a10=0, a12=0, a19=9, a1=23, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a10=0, a12=0, a19=9, a1=23, a4=14, input=3, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND TRUE ((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0)) [L436] a1 = ((((a1 / 5) * 5) / 5) + 505228) [L437] a10 = 1 [L439] return 25; VAL [\result=25, a10=1, a12=0, a19=9, a1=505232, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] output = calculate_output(input) [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a10=1, a12=0, a19=9, a1=505232, a4=14, input=2, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND TRUE ((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 ))) [L297] a1 = ((((((a1 % 89)+ 74) - -21) * 5) % 89)- -118) [L298] a19 = 10 [L300] return 25; VAL [\result=25, a10=1, a12=0, a19=10, a1=132, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] output = calculate_output(input) [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL, EXPR calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L49] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L52] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L55] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L58] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L61] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L64] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L67] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L70] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L73] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L76] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L79] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L82] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L85] COND FALSE !((((((a10==1) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L88] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L91] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L94] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L97] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L100] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L103] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L106] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L109] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L112] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L115] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L118] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L121] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L124] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L127] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L130] COND FALSE !((((((a10==4) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L133] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L136] COND FALSE !((((((a10==3) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L139] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L142] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L145] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L148] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L151] COND FALSE !((((((a10==1) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L154] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L157] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L160] COND FALSE !((((((a10==0) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L163] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L166] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L169] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L172] COND FALSE !((((((a10==0) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L175] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L178] COND FALSE !((((((a10==3) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L181] COND FALSE !((((((a10==2) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L184] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L187] COND FALSE !((((((a10==4) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L190] COND FALSE !((((((a10==0) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L193] COND FALSE !((((((a10==2) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L196] COND FALSE !((((((a10==3) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L199] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L202] COND FALSE !((((((a10==3) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L205] COND FALSE !((((((a10==1) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==7))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L208] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L211] COND FALSE !((((((a10==1) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==6))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L215] COND FALSE !((((a10==4) && ( 218 < a1 && (((input == 4) && (a12==0)) && (a4==14)))) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L220] COND FALSE !(((a4==14) && (((a12==0) && ((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a19==9))) && (a10==0)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L225] COND FALSE !(((((a4==14) && ((a19==10) && ((a10==1) && (input == 2)))) && (a12==0)) && 218 < a1 )) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L230] COND FALSE !(((a12==0) && ((a19==9) && ((a10==1) && (( 218 < a1 && (input == 3)) && (a4==14)))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L235] COND FALSE !(((a19==10) && (((a4==14) && (((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ((a10==0) && 218 < a1 )) || ((a10==1) && a1 <= -13 )) && (input == 5))) && (a12==0)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L241] COND FALSE !(((a12==0) && ((a19==9) && (((a4==14) && ((input == 2) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a10==3))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L246] COND FALSE !(((a12==0) && ((((a4==14) && ((input == 3) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a10==2)) && (a19==9)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L249] COND FALSE !((((a12==0) && ( ((-13 < a1) && (38 >= a1)) && (((input == 3) && (a19==10)) && (a4==14)))) && (a10==1))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L254] COND FALSE !((((a19==9) && (((input == 6) && (( 218 < a1 && (a10==0)) || ( a1 <= -13 && (a10==1)))) && (a4==14))) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L259] COND FALSE !(( ((38 < a1) && (218 >= a1)) && (((a4==14) && ((a19==10) && ((a10==1) && (input == 4)))) && (a12==0)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L264] COND FALSE !((((a4==14) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5)) && (a19==9)) && (a12==0))) && (a10==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L270] COND FALSE !((((a4==14) && ((((((a10==2) && ((38 < a1) && (218 >= a1)) ) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3))) && (input == 2)) && (a19==9))) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L275] COND FALSE !((((a10==1) && (((a12==0) && ((input == 6) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a4==14))) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L281] COND FALSE !(((((((input == 5) && (a4==14)) && 218 < a1 ) && (a10==4)) && (a19==9)) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L287] COND FALSE !(((a19==10) && ((a4==14) && ((a12==0) && ((input == 4) && ((((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0))) || ((a10==1) && a1 <= -13 ))))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L293] COND FALSE !((((a12==0) && ((((a19==9) && (input == 4)) && 218 < a1 ) && (a10==1))) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L296] COND FALSE !(((a10==1) && ((a4==14) && ((((a12==0) && (input == 2)) && (a19==9)) && 218 < a1 )))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L301] COND FALSE !((((a4==14) && (((input == 4) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ( a1 <= -13 && (a10==3)))) && (a19==9))) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L306] COND FALSE !(((((a12==0) && ((((a10==0) && 218 < a1 ) || ((a10==1) && a1 <= -13 )) && (input == 2))) && (a19==9)) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L311] COND FALSE !((((a4==14) && ((a12==0) && ((input == 3) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))))) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L316] COND FALSE !((((((a10==1) && ((a12==0) && (input == 6))) && (a19==10)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L322] COND FALSE !(((a19==9) && (((a10==4) && ( 218 < a1 && ((a4==14) && (input == 6)))) && (a12==0)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L327] COND FALSE !((((a10==0) && ((a12==0) && (((input == 4) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)))) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L330] COND FALSE !(((a19==9) && ((((a4==14) && ((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ))) && (a12==0)) && (a10==2)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L333] COND FALSE !((((((a12==0) && ((input == 4) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ))) && (a19==9)) && (a4==14)) && (a10==3))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L336] COND FALSE !((((a4==14) && (((a12==0) && ( 218 < a1 && (input == 6))) && (a19==10))) && (a10==1))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L339] COND FALSE !(((((((input == 2) && ( a1 <= -13 || ((-13 < a1) && (38 >= a1)) )) && (a19==10)) && (a10==0)) && (a4==14)) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L345] COND FALSE !((((((( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 )) && (input == 3)) && (a4==14)) && (a12==0)) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L350] COND FALSE !(((a12==0) && ((a19==9) && (((input == 6) && (((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4)))) && (a4==14))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L355] COND FALSE !((((a10==3) && (((a19==9) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 5))) && (a12==0))) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L361] COND FALSE !((((a12==0) && ((a10==1) && ( 218 < a1 && ((a19==9) && (input == 6))))) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L364] COND FALSE !(((a10==0) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 3)) && (a19==10)) && (a4==14))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L367] COND FALSE !((((a10==4) && (((( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4)) && (a4==14)) && (a19==9))) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L370] COND FALSE !(((a4==14) && ((a10==1) && ((a19==9) && ((a12==0) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 4))))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L375] COND FALSE !(((a4==14) && ((a19==9) && (((( a1 <= -13 && (a10==3)) || (( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 ))) && (input == 3)) && (a12==0))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L380] COND FALSE !((((((a4==14) && ((input == 6) && (a10==1))) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a19==10))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L385] COND FALSE !(((a4==14) && (((a12==0) && ( 218 < a1 && ((a19==9) && (input == 3)))) && (a10==4)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L388] COND FALSE !((((a4==14) && ((a12==0) && ((((a10==3) && 218 < a1 ) || ((a10==4) && a1 <= -13 )) && (input == 4)))) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L393] COND FALSE !((((a12==0) && (((a10==4) && (( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) ) && (input == 3))) && (a4==14))) && (a19==9))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L398] COND FALSE !(((a19==9) && ((a4==14) && (((input == 5) && ((( ((38 < a1) && (218 >= a1)) && (a10==2)) || ((a10==2) && 218 < a1 )) || ((a10==3) && a1 <= -13 ))) && (a12==0))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L403] COND FALSE !(((a12==0) && (((a19==9) && ((((a10==0) && 218 < a1 ) || ( a1 <= -13 && (a10==1))) && (input == 5))) && (a4==14)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L408] COND FALSE !(( 218 < a1 && ((((a12==0) && ((a19==9) && (input == 2))) && (a10==4)) && (a4==14)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L413] COND FALSE !((((a12==0) && ((a19==9) && ((((a10==3) && a1 <= -13 ) || (((a10==2) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==2)))) && (input == 6)))) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L418] COND FALSE !(((a19==9) && ((a12==0) && (((( a1 <= -13 || ((-13 < a1) && (38 >= a1)) ) && (input == 5)) && (a4==14)) && (a10==2))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L424] COND FALSE !((((a10==1) && (((a12==0) && ((a19==10) && (input == 4))) && ((-13 < a1) && (38 >= a1)) )) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L429] COND FALSE !(((a12==0) && ((a4==14) && ( 218 < a1 && (((a10==1) && (input == 4)) && (a19==10)))))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L435] COND FALSE !(((((((input == 3) && ( ((-13 < a1) && (38 >= a1)) || ((38 < a1) && (218 >= a1)) )) && (a10==0)) && (a19==9)) && (a4==14)) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L440] COND FALSE !((((a4==14) && (((( a1 <= -13 && (a10==1)) || (((a10==0) && ((38 < a1) && (218 >= a1)) ) || ( 218 < a1 && (a10==0)))) && (input == 6)) && (a19==10))) && (a12==0))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L446] COND FALSE !(((a19==9) && ((((input == 4) && (( 218 < a1 && (a10==0)) || ((a10==1) && a1 <= -13 ))) && (a12==0)) && (a4==14)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L452] COND FALSE !((((a19==10) && ((a12==0) && ((((a10==1) && a1 <= -13 ) || (( ((38 < a1) && (218 >= a1)) && (a10==0)) || ((a10==0) && 218 < a1 ))) && (input == 3)))) && (a4==14))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L458] COND FALSE !(((a19==9) && (((a4==14) && ((((a10==3) && 218 < a1 ) || ( a1 <= -13 && (a10==4))) && (input == 5))) && (a12==0)))) VAL [a10=1, a12=0, a19=10, a1=132, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L464] COND TRUE (((a12==0) && ((((input == 5) && (a19==10)) && ((38 < a1) && (218 >= a1)) ) && (a4==14))) && (a10==1)) [L465] a1 = ((((a1 + 381077) % 25)- -1) / 5) [L466] a10 = 2 [L467] a19 = 7 [L469] return -1; VAL [\result=-1, a10=2, a12=0, a19=7, a1=2, a4=14, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L600] RET, EXPR calculate_output(input) [L600] output = calculate_output(input) [L595] int input; [L596] input = __VERIFIER_nondet_int() [L597] COND FALSE !((input != 2) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L600] CALL calculate_output(input) [L31] COND FALSE !((((((a10==4) && (a12==0)) && ((38 < a1) && (218 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=2, a12=0, a19=7, a1=2, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L34] COND FALSE !((((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==8))) VAL [a10=2, a12=0, a19=7, a1=2, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L37] COND FALSE !((((((a10==0) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=2, a12=0, a19=7, a1=2, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L40] COND FALSE !((((((a10==2) && (a12==0)) && 218 < a1 ) && (a4==14)) && (a19==8))) VAL [a10=2, a12=0, a19=7, a1=2, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L43] COND FALSE !((((((a10==4) && (a12==0)) && a1 <= -13 ) && (a4==14)) && (a19==6))) VAL [a10=2, a12=0, a19=7, a1=2, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L46] COND TRUE (((((a10==2) && (a12==0)) && ((-13 < a1) && (38 >= a1)) ) && (a4==14)) && (a19==7)) VAL [a10=2, a12=0, a19=7, a1=2, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] [L47] reach_error() VAL [a10=2, a12=0, a19=7, a1=2, a4=14, input=5, inputB=2, inputC=3, inputD=4, inputE=5, inputF=6] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.4s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 8.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1198 SdHoareTripleChecker+Valid, 7.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1198 mSDsluCounter, 1391 SdHoareTripleChecker+Invalid, 6.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 71 mSDsCounter, 702 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4968 IncrementalHoareTripleChecker+Invalid, 5670 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 702 mSolverCounterUnsat, 1320 mSDtfsCounter, 4968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 276 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2367occurred in iteration=11, InterpolantAutomatonStates: 41, 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, 12 MinimizatonAttempts, 834 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2630 NumberOfCodeBlocks, 2630 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2298 ConstructedInterpolants, 0 QuantifiedInterpolants, 7896 SizeOfPredicates, 0 NumberOfNonLiveVariables, 344 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1274/1369 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 02:54:10,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7f34f09-07cb-442c-be4b-12f374216c76/bin/uautomizer-verify-aQ6SnzHsRB/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