./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version a0165632
Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX --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 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190
--- Real Ultimate output ---
This is Ultimate 0.2.5-dev-a016563
[2024-11-08 18:13:41,496 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-08 18:13:41,603 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-08 18:13:41,610 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-08 18:13:41,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-08 18:13:41,657 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-08 18:13:41,657 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-08 18:13:41,658 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-08 18:13:41,659 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-08 18:13:41,661 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-08 18:13:41,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-08 18:13:41,662 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-08 18:13:41,663 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-08 18:13:41,663 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-08 18:13:41,663 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-08 18:13:41,664 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-08 18:13:41,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-08 18:13:41,668 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-08 18:13:41,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-08 18:13:41,668 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-08 18:13:41,669 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-08 18:13:41,669 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-08 18:13:41,670 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-08 18:13:41,673 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-08 18:13:41,674 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-08 18:13:41,674 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-08 18:13:41,674 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-08 18:13:41,675 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-08 18:13:41,675 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-08 18:13:41,675 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-08 18:13:41,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-08 18:13:41,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-08 18:13:41,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:13:41,679 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-08 18:13:41,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-08 18:13:41,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-08 18:13:41,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-08 18:13:41,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-08 18:13:41,680 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-08 18:13:41,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-08 18:13:41,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-08 18:13:41,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-08 18:13:41,683 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX
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 -> 906036225f588312d23f50dd6f109319810cf1ead43ce885e134bcc5a0be0190
[2024-11-08 18:13:42,054 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-08 18:13:42,087 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-08 18:13:42,091 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-08 18:13:42,092 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-08 18:13:42,093 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-08 18:13:42,095 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c
Unable to find full path for "g++"
[2024-11-08 18:13:44,339 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-08 18:13:44,616 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-08 18:13:44,617 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c
[2024-11-08 18:13:44,634 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/data/2e41c9ade/1d64e6fc435c4ce7a5eb536b9f6bdad8/FLAGb0d13dce3
[2024-11-08 18:13:44,652 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/data/2e41c9ade/1d64e6fc435c4ce7a5eb536b9f6bdad8
[2024-11-08 18:13:44,655 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-08 18:13:44,657 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-08 18:13:44,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-08 18:13:44,659 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-08 18:13:44,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-08 18:13:44,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:13:44" (1/1) ...
[2024-11-08 18:13:44,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74b6995a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:44, skipping insertion in model container
[2024-11-08 18:13:44,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 06:13:44" (1/1) ...
[2024-11-08 18:13:44,735 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-08 18:13:45,275 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_6c5f38f1-5465-48ad-997f-b0889e6b558a/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695]
[2024-11-08 18:13:45,287 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:13:45,312 INFO L200 MainTranslator]: Completed pre-run
[2024-11-08 18:13:45,441 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_6c5f38f1-5465-48ad-997f-b0889e6b558a/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c[14682,14695]
[2024-11-08 18:13:45,442 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-08 18:13:45,479 INFO L204 MainTranslator]: Completed translation
[2024-11-08 18:13:45,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45 WrapperNode
[2024-11-08 18:13:45,480 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-08 18:13:45,482 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-08 18:13:45,483 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-08 18:13:45,483 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-08 18:13:45,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,579 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 506
[2024-11-08 18:13:45,584 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-08 18:13:45,585 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-08 18:13:45,585 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-08 18:13:45,585 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-08 18:13:45,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,627 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,674 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-08 18:13:45,678 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,678 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,708 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,721 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-08 18:13:45,722 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-08 18:13:45,722 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-08 18:13:45,722 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-08 18:13:45,724 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (1/1) ...
[2024-11-08 18:13:45,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-08 18:13:45,768 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/z3
[2024-11-08 18:13:45,788 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-08 18:13:45,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-08 18:13:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history
[2024-11-08 18:13:45,837 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history
[2024-11-08 18:13:45,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-08 18:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history
[2024-11-08 18:13:45,838 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history
[2024-11-08 18:13:45,838 INFO L130 BoogieDeclarations]: Found specification of procedure assert
[2024-11-08 18:13:45,838 INFO L138 BoogieDeclarations]: Found implementation of procedure assert
[2024-11-08 18:13:45,840 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side
[2024-11-08 18:13:45,840 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side
[2024-11-08 18:13:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2024-11-08 18:13:45,841 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2024-11-08 18:13:45,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-08 18:13:45,842 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history
[2024-11-08 18:13:45,842 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history
[2024-11-08 18:13:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-08 18:13:45,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-08 18:13:45,843 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history
[2024-11-08 18:13:45,844 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history
[2024-11-08 18:13:46,021 INFO L238 CfgBuilder]: Building ICFG
[2024-11-08 18:13:46,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-08 18:13:46,953 INFO L? ?]: Removed 114 outVars from TransFormulas that were not future-live.
[2024-11-08 18:13:46,953 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-08 18:13:46,982 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-08 18:13:46,982 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-08 18:13:46,983 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:13:46 BoogieIcfgContainer
[2024-11-08 18:13:46,983 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-08 18:13:46,988 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-08 18:13:46,988 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-08 18:13:46,993 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-08 18:13:46,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 06:13:44" (1/3) ...
[2024-11-08 18:13:46,994 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f92895a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:13:46, skipping insertion in model container
[2024-11-08 18:13:46,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 06:13:45" (2/3) ...
[2024-11-08 18:13:46,995 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f92895a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 06:13:46, skipping insertion in model container
[2024-11-08 18:13:46,995 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:13:46" (3/3) ...
[2024-11-08 18:13:46,997 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.UNBOUNDED.pals.c
[2024-11-08 18:13:47,020 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-08 18:13:47,020 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-08 18:13:47,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-08 18:13:47,117 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;@afe815b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-08 18:13:47,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-08 18:13:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2024-11-08 18:13:47,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2024-11-08 18:13:47,136 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:47,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:13:47,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:47,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:47,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1079647552, now seen corresponding path program 1 times
[2024-11-08 18:13:47,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:47,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716694908]
[2024-11-08 18:13:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:47,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:47,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-08 18:13:47,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:47,616 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-08 18:13:47,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:47,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716694908]
[2024-11-08 18:13:47,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716694908] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:47,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:47,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-08 18:13:47,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499058714]
[2024-11-08 18:13:47,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:47,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2024-11-08 18:13:47,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:47,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2024-11-08 18:13:47,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:13:47,693 INFO L87 Difference]: Start difference. First operand has 180 states, 140 states have (on average 1.5571428571428572) internal successors, (218), 142 states have internal predecessors, (218), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 18:13:47,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:47,774 INFO L93 Difference]: Finished difference Result 340 states and 557 transitions.
[2024-11-08 18:13:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2024-11-08 18:13:47,778 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2024-11-08 18:13:47,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:47,791 INFO L225 Difference]: With dead ends: 340
[2024-11-08 18:13:47,791 INFO L226 Difference]: Without dead ends: 176
[2024-11-08 18:13:47,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2024-11-08 18:13:47,802 INFO L432 NwaCegarLoop]: 273 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:47,804 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:13:47,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2024-11-08 18:13:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176.
[2024-11-08 18:13:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.5401459854014599) internal successors, (211), 138 states have internal predecessors, (211), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2024-11-08 18:13:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 273 transitions.
[2024-11-08 18:13:47,900 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 273 transitions. Word has length 28
[2024-11-08 18:13:47,900 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:47,901 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 273 transitions.
[2024-11-08 18:13:47,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 18:13:47,901 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 273 transitions.
[2024-11-08 18:13:47,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29
[2024-11-08 18:13:47,904 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:47,904 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:13:47,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-08 18:13:47,905 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:47,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:47,907 INFO L85 PathProgramCache]: Analyzing trace with hash -860792834, now seen corresponding path program 1 times
[2024-11-08 18:13:47,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:47,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385039468]
[2024-11-08 18:13:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:47,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:48,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-08 18:13:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:48,334 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-08 18:13:48,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:48,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385039468]
[2024-11-08 18:13:48,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385039468] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:48,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6
[2024-11-08 18:13:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148958870]
[2024-11-08 18:13:48,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:48,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states
[2024-11-08 18:13:48,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:48,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants.
[2024-11-08 18:13:48,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:13:48,340 INFO L87 Difference]: Start difference. First operand 176 states and 273 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 18:13:48,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:48,478 INFO L93 Difference]: Finished difference Result 338 states and 520 transitions.
[2024-11-08 18:13:48,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2024-11-08 18:13:48,479 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28
[2024-11-08 18:13:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:48,482 INFO L225 Difference]: With dead ends: 338
[2024-11-08 18:13:48,483 INFO L226 Difference]: Without dead ends: 176
[2024-11-08 18:13:48,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30
[2024-11-08 18:13:48,486 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1323 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:48,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1323 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 18:13:48,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states.
[2024-11-08 18:13:48,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176.
[2024-11-08 18:13:48,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 137 states have (on average 1.4525547445255473) internal successors, (199), 138 states have internal predecessors, (199), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2024-11-08 18:13:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 261 transitions.
[2024-11-08 18:13:48,510 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 261 transitions. Word has length 28
[2024-11-08 18:13:48,510 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:48,511 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 261 transitions.
[2024-11-08 18:13:48,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 18:13:48,511 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 261 transitions.
[2024-11-08 18:13:48,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40
[2024-11-08 18:13:48,513 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:48,513 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:13:48,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-08 18:13:48,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:48,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1423839069, now seen corresponding path program 1 times
[2024-11-08 18:13:48,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:48,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266938515]
[2024-11-08 18:13:48,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:48,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:48,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:48,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:48,936 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-08 18:13:48,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266938515]
[2024-11-08 18:13:48,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266938515] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:48,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:48,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:13:48,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754867539]
[2024-11-08 18:13:48,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:48,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:13:48,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:48,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:13:48,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:13:48,946 INFO L87 Difference]: Start difference. First operand 176 states and 261 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 18:13:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:49,050 INFO L93 Difference]: Finished difference Result 339 states and 512 transitions.
[2024-11-08 18:13:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:13:49,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39
[2024-11-08 18:13:49,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:49,053 INFO L225 Difference]: With dead ends: 339
[2024-11-08 18:13:49,057 INFO L226 Difference]: Without dead ends: 180
[2024-11-08 18:13:49,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-08 18:13:49,060 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 3 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:49,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 755 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 18:13:49,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states.
[2024-11-08 18:13:49,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180.
[2024-11-08 18:13:49,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.4428571428571428) internal successors, (202), 141 states have internal predecessors, (202), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31)
[2024-11-08 18:13:49,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 264 transitions.
[2024-11-08 18:13:49,099 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 264 transitions. Word has length 39
[2024-11-08 18:13:49,099 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:49,100 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 264 transitions.
[2024-11-08 18:13:49,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-08 18:13:49,100 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 264 transitions.
[2024-11-08 18:13:49,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56
[2024-11-08 18:13:49,103 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:49,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:49,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-08 18:13:49,104 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:49,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:49,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1933786197, now seen corresponding path program 1 times
[2024-11-08 18:13:49,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:49,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832875161]
[2024-11-08 18:13:49,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:49,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:49,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:49,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:49,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:49,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41
[2024-11-08 18:13:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 18:13:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:49,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832875161]
[2024-11-08 18:13:49,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832875161] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:49,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:49,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:13:49,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395580227]
[2024-11-08 18:13:49,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:49,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:13:49,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:49,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:13:49,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:13:49,287 INFO L87 Difference]: Start difference. First operand 180 states and 264 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:49,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:49,362 INFO L93 Difference]: Finished difference Result 494 states and 735 transitions.
[2024-11-08 18:13:49,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:13:49,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 55
[2024-11-08 18:13:49,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:49,368 INFO L225 Difference]: With dead ends: 494
[2024-11-08 18:13:49,369 INFO L226 Difference]: Without dead ends: 331
[2024-11-08 18:13:49,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-08 18:13:49,374 INFO L432 NwaCegarLoop]: 271 mSDtfsCounter, 212 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:49,379 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 523 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:13:49,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states.
[2024-11-08 18:13:49,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 326.
[2024-11-08 18:13:49,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 249 states have (on average 1.461847389558233) internal successors, (364), 251 states have internal predecessors, (364), 60 states have call successors, (60), 16 states have call predecessors, (60), 16 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60)
[2024-11-08 18:13:49,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions.
[2024-11-08 18:13:49,446 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 55
[2024-11-08 18:13:49,447 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:49,447 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions.
[2024-11-08 18:13:49,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions.
[2024-11-08 18:13:49,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-11-08 18:13:49,452 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:49,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:49,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-08 18:13:49,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:49,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:49,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1757141284, now seen corresponding path program 1 times
[2024-11-08 18:13:49,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:49,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172794683]
[2024-11-08 18:13:49,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:49,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:49,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:49,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:49,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:49,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:49,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:49,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-08 18:13:49,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:49,620 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 18:13:49,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:49,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172794683]
[2024-11-08 18:13:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172794683] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:49,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:49,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-08 18:13:49,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098138206]
[2024-11-08 18:13:49,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:49,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-08 18:13:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:49,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-08 18:13:49,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-08 18:13:49,628 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:49,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:49,731 INFO L93 Difference]: Finished difference Result 917 states and 1373 transitions.
[2024-11-08 18:13:49,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-08 18:13:49,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56
[2024-11-08 18:13:49,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:49,744 INFO L225 Difference]: With dead ends: 917
[2024-11-08 18:13:49,745 INFO L226 Difference]: Without dead ends: 608
[2024-11-08 18:13:49,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-08 18:13:49,748 INFO L432 NwaCegarLoop]: 291 mSDtfsCounter, 214 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:49,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 545 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:13:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states.
[2024-11-08 18:13:49,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 602.
[2024-11-08 18:13:49,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 453 states have (on average 1.4724061810154525) internal successors, (667), 457 states have internal predecessors, (667), 117 states have call successors, (117), 31 states have call predecessors, (117), 31 states have return successors, (117), 114 states have call predecessors, (117), 117 states have call successors, (117)
[2024-11-08 18:13:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 901 transitions.
[2024-11-08 18:13:49,831 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 901 transitions. Word has length 56
[2024-11-08 18:13:49,832 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:49,832 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 901 transitions.
[2024-11-08 18:13:49,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:49,835 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 901 transitions.
[2024-11-08 18:13:49,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57
[2024-11-08 18:13:49,841 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:49,842 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:49,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-08 18:13:49,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:49,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:49,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1257962334, now seen corresponding path program 1 times
[2024-11-08 18:13:49,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:49,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205700242]
[2024-11-08 18:13:49,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:49,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:50,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:50,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:50,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42
[2024-11-08 18:13:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:50,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 18:13:50,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:50,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205700242]
[2024-11-08 18:13:50,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205700242] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:50,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:50,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:13:50,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753124128]
[2024-11-08 18:13:50,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:50,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:13:50,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:50,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:13:50,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:13:50,104 INFO L87 Difference]: Start difference. First operand 602 states and 901 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:50,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:50,410 INFO L93 Difference]: Finished difference Result 1291 states and 1928 transitions.
[2024-11-08 18:13:50,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:13:50,411 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 56
[2024-11-08 18:13:50,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:50,421 INFO L225 Difference]: With dead ends: 1291
[2024-11-08 18:13:50,421 INFO L226 Difference]: Without dead ends: 706
[2024-11-08 18:13:50,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:13:50,424 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 368 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:50,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 669 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 18:13:50,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states.
[2024-11-08 18:13:50,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 690.
[2024-11-08 18:13:50,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 528 states have (on average 1.456439393939394) internal successors, (769), 531 states have internal predecessors, (769), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124)
[2024-11-08 18:13:50,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 1017 transitions.
[2024-11-08 18:13:50,511 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 1017 transitions. Word has length 56
[2024-11-08 18:13:50,512 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:50,513 INFO L471 AbstractCegarLoop]: Abstraction has 690 states and 1017 transitions.
[2024-11-08 18:13:50,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:50,513 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 1017 transitions.
[2024-11-08 18:13:50,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58
[2024-11-08 18:13:50,515 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:50,516 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:50,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-08 18:13:50,516 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:50,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:50,517 INFO L85 PathProgramCache]: Analyzing trace with hash 848592276, now seen corresponding path program 1 times
[2024-11-08 18:13:50,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:50,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547433651]
[2024-11-08 18:13:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:50,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:50,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:50,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:50,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:50,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43
[2024-11-08 18:13:50,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 18:13:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:50,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547433651]
[2024-11-08 18:13:50,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547433651] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:50,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:50,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2024-11-08 18:13:50,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215847004]
[2024-11-08 18:13:50,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:50,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states
[2024-11-08 18:13:50,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:50,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2024-11-08 18:13:50,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-08 18:13:50,834 INFO L87 Difference]: Start difference. First operand 690 states and 1017 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:51,121 INFO L93 Difference]: Finished difference Result 1295 states and 1928 transitions.
[2024-11-08 18:13:51,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:13:51,122 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57
[2024-11-08 18:13:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:51,129 INFO L225 Difference]: With dead ends: 1295
[2024-11-08 18:13:51,130 INFO L226 Difference]: Without dead ends: 710
[2024-11-08 18:13:51,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:13:51,133 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 368 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 669 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:51,136 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 669 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 18:13:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states.
[2024-11-08 18:13:51,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 698.
[2024-11-08 18:13:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4496268656716418) internal successors, (777), 539 states have internal predecessors, (777), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124)
[2024-11-08 18:13:51,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1025 transitions.
[2024-11-08 18:13:51,213 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1025 transitions. Word has length 57
[2024-11-08 18:13:51,213 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:51,213 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1025 transitions.
[2024-11-08 18:13:51,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1025 transitions.
[2024-11-08 18:13:51,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60
[2024-11-08 18:13:51,217 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:51,217 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:51,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-08 18:13:51,218 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:51,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:51,218 INFO L85 PathProgramCache]: Analyzing trace with hash -825390426, now seen corresponding path program 1 times
[2024-11-08 18:13:51,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:51,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420705141]
[2024-11-08 18:13:51,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:51,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:51,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:51,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:51,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:51,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45
[2024-11-08 18:13:51,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:51,455 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 18:13:51,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:51,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420705141]
[2024-11-08 18:13:51,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420705141] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:51,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:51,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:13:51,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103761569]
[2024-11-08 18:13:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:51,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:13:51,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:51,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:13:51,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:13:51,458 INFO L87 Difference]: Start difference. First operand 698 states and 1025 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:51,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:51,702 INFO L93 Difference]: Finished difference Result 1283 states and 1908 transitions.
[2024-11-08 18:13:51,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:13:51,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 59
[2024-11-08 18:13:51,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:51,708 INFO L225 Difference]: With dead ends: 1283
[2024-11-08 18:13:51,709 INFO L226 Difference]: Without dead ends: 698
[2024-11-08 18:13:51,711 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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-08 18:13:51,712 INFO L432 NwaCegarLoop]: 228 mSDtfsCounter, 61 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:51,712 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 663 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 18:13:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states.
[2024-11-08 18:13:51,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 698.
[2024-11-08 18:13:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 536 states have (on average 1.4421641791044777) internal successors, (773), 539 states have internal predecessors, (773), 124 states have call successors, (124), 37 states have call predecessors, (124), 37 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124)
[2024-11-08 18:13:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 1021 transitions.
[2024-11-08 18:13:51,782 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 1021 transitions. Word has length 59
[2024-11-08 18:13:51,782 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:51,782 INFO L471 AbstractCegarLoop]: Abstraction has 698 states and 1021 transitions.
[2024-11-08 18:13:51,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3)
[2024-11-08 18:13:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 1021 transitions.
[2024-11-08 18:13:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61
[2024-11-08 18:13:51,785 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:51,785 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:51,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-08 18:13:51,785 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:51,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:51,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1828541332, now seen corresponding path program 1 times
[2024-11-08 18:13:51,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:51,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100113320]
[2024-11-08 18:13:51,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:51,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:52,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:52,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:52,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:52,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:52,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 18:13:52,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:52,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100113320]
[2024-11-08 18:13:52,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100113320] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:52,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:52,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:13:52,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259322873]
[2024-11-08 18:13:52,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:52,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:13:52,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:52,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:13:52,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:13:52,105 INFO L87 Difference]: Start difference. First operand 698 states and 1021 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-08 18:13:52,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:52,217 INFO L93 Difference]: Finished difference Result 1303 states and 1932 transitions.
[2024-11-08 18:13:52,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:13:52,218 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 60
[2024-11-08 18:13:52,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:52,225 INFO L225 Difference]: With dead ends: 1303
[2024-11-08 18:13:52,225 INFO L226 Difference]: Without dead ends: 718
[2024-11-08 18:13:52,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-08 18:13:52,231 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 4 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:52,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 767 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:13:52,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states.
[2024-11-08 18:13:52,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718.
[2024-11-08 18:13:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 552 states have (on average 1.4293478260869565) internal successors, (789), 555 states have internal predecessors, (789), 124 states have call successors, (124), 41 states have call predecessors, (124), 41 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124)
[2024-11-08 18:13:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1037 transitions.
[2024-11-08 18:13:52,354 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1037 transitions. Word has length 60
[2024-11-08 18:13:52,356 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:52,356 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1037 transitions.
[2024-11-08 18:13:52,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3)
[2024-11-08 18:13:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1037 transitions.
[2024-11-08 18:13:52,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69
[2024-11-08 18:13:52,359 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:52,359 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:52,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8
[2024-11-08 18:13:52,359 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:52,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:52,360 INFO L85 PathProgramCache]: Analyzing trace with hash -152675502, now seen corresponding path program 1 times
[2024-11-08 18:13:52,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:52,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930882131]
[2024-11-08 18:13:52,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:52,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:52,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:52,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:52,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:52,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:52,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:52,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:13:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:52,641 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 18:13:52,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:52,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930882131]
[2024-11-08 18:13:52,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930882131] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:52,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:52,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:13:52,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689471004]
[2024-11-08 18:13:52,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:52,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:13:52,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:52,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:13:52,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:13:52,644 INFO L87 Difference]: Start difference. First operand 718 states and 1037 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2024-11-08 18:13:52,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:52,766 INFO L93 Difference]: Finished difference Result 1343 states and 1976 transitions.
[2024-11-08 18:13:52,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:13:52,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 68
[2024-11-08 18:13:52,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:52,773 INFO L225 Difference]: With dead ends: 1343
[2024-11-08 18:13:52,773 INFO L226 Difference]: Without dead ends: 738
[2024-11-08 18:13:52,776 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-08 18:13:52,777 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:52,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:13:52,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states.
[2024-11-08 18:13:52,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738.
[2024-11-08 18:13:52,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 568 states have (on average 1.4172535211267605) internal successors, (805), 571 states have internal predecessors, (805), 124 states have call successors, (124), 45 states have call predecessors, (124), 45 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124)
[2024-11-08 18:13:52,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 1053 transitions.
[2024-11-08 18:13:52,846 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 1053 transitions. Word has length 68
[2024-11-08 18:13:52,847 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:52,847 INFO L471 AbstractCegarLoop]: Abstraction has 738 states and 1053 transitions.
[2024-11-08 18:13:52,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4)
[2024-11-08 18:13:52,848 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 1053 transitions.
[2024-11-08 18:13:52,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2024-11-08 18:13:52,849 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:52,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:52,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9
[2024-11-08 18:13:52,850 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:52,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:52,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1204030172, now seen corresponding path program 1 times
[2024-11-08 18:13:52,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:52,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648160790]
[2024-11-08 18:13:52,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:52,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:52,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:53,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:13:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:13:53,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,138 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 18:13:53,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:53,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648160790]
[2024-11-08 18:13:53,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648160790] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:53,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:53,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:13:53,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725996620]
[2024-11-08 18:13:53,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:53,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:13:53,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:53,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:13:53,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:13:53,142 INFO L87 Difference]: Start difference. First operand 738 states and 1053 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2024-11-08 18:13:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:53,247 INFO L93 Difference]: Finished difference Result 1379 states and 1992 transitions.
[2024-11-08 18:13:53,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:13:53,248 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76
[2024-11-08 18:13:53,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:53,254 INFO L225 Difference]: With dead ends: 1379
[2024-11-08 18:13:53,254 INFO L226 Difference]: Without dead ends: 754
[2024-11-08 18:13:53,257 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-08 18:13:53,257 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:53,258 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:13:53,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states.
[2024-11-08 18:13:53,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754.
[2024-11-08 18:13:53,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 580 states have (on average 1.4086206896551725) internal successors, (817), 583 states have internal predecessors, (817), 124 states have call successors, (124), 49 states have call predecessors, (124), 49 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124)
[2024-11-08 18:13:53,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1065 transitions.
[2024-11-08 18:13:53,327 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1065 transitions. Word has length 76
[2024-11-08 18:13:53,328 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:53,328 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1065 transitions.
[2024-11-08 18:13:53,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2024-11-08 18:13:53,328 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1065 transitions.
[2024-11-08 18:13:53,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77
[2024-11-08 18:13:53,333 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:53,333 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:53,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10
[2024-11-08 18:13:53,334 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:53,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:53,334 INFO L85 PathProgramCache]: Analyzing trace with hash -694477821, now seen corresponding path program 1 times
[2024-11-08 18:13:53,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:53,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834600371]
[2024-11-08 18:13:53,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:53,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:53,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:13:53,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:13:53,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-08 18:13:53,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:53,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834600371]
[2024-11-08 18:13:53,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834600371] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:53,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:53,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:13:53,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699126047]
[2024-11-08 18:13:53,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:53,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:13:53,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:53,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:13:53,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:13:53,625 INFO L87 Difference]: Start difference. First operand 754 states and 1065 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2024-11-08 18:13:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:53,747 INFO L93 Difference]: Finished difference Result 1415 states and 2032 transitions.
[2024-11-08 18:13:53,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:13:53,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 76
[2024-11-08 18:13:53,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:53,754 INFO L225 Difference]: With dead ends: 1415
[2024-11-08 18:13:53,754 INFO L226 Difference]: Without dead ends: 774
[2024-11-08 18:13:53,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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-08 18:13:53,757 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 4 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:53,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 753 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:13:53,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 774 states.
[2024-11-08 18:13:53,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 774 to 774.
[2024-11-08 18:13:53,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 774 states, 596 states have (on average 1.3976510067114094) internal successors, (833), 599 states have internal predecessors, (833), 124 states have call successors, (124), 53 states have call predecessors, (124), 53 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124)
[2024-11-08 18:13:53,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 1081 transitions.
[2024-11-08 18:13:53,828 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 1081 transitions. Word has length 76
[2024-11-08 18:13:53,828 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:53,829 INFO L471 AbstractCegarLoop]: Abstraction has 774 states and 1081 transitions.
[2024-11-08 18:13:53,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5)
[2024-11-08 18:13:53,829 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 1081 transitions.
[2024-11-08 18:13:53,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85
[2024-11-08 18:13:53,832 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:53,832 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:53,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11
[2024-11-08 18:13:53,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:53,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:53,833 INFO L85 PathProgramCache]: Analyzing trace with hash 660978147, now seen corresponding path program 1 times
[2024-11-08 18:13:53,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:53,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371375356]
[2024-11-08 18:13:53,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:53,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:53,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:54,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:54,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:54,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:54,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:13:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:54,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:13:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:54,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:13:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:54,207 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked.
[2024-11-08 18:13:54,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:54,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371375356]
[2024-11-08 18:13:54,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371375356] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:54,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:54,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:13:54,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208526319]
[2024-11-08 18:13:54,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:54,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:13:54,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:54,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:13:54,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:13:54,211 INFO L87 Difference]: Start difference. First operand 774 states and 1081 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)
[2024-11-08 18:13:54,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:54,313 INFO L93 Difference]: Finished difference Result 1459 states and 2060 transitions.
[2024-11-08 18:13:54,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:13:54,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 84
[2024-11-08 18:13:54,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:54,320 INFO L225 Difference]: With dead ends: 1459
[2024-11-08 18:13:54,320 INFO L226 Difference]: Without dead ends: 798
[2024-11-08 18:13:54,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-08 18:13:54,324 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 5 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:54,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 765 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:13:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states.
[2024-11-08 18:13:54,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 798.
[2024-11-08 18:13:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 616 states have (on average 1.3847402597402598) internal successors, (853), 619 states have internal predecessors, (853), 124 states have call successors, (124), 57 states have call predecessors, (124), 57 states have return successors, (124), 121 states have call predecessors, (124), 124 states have call successors, (124)
[2024-11-08 18:13:54,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1101 transitions.
[2024-11-08 18:13:54,396 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1101 transitions. Word has length 84
[2024-11-08 18:13:54,397 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:54,397 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1101 transitions.
[2024-11-08 18:13:54,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6)
[2024-11-08 18:13:54,397 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1101 transitions.
[2024-11-08 18:13:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88
[2024-11-08 18:13:54,400 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:54,400 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:54,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12
[2024-11-08 18:13:54,401 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:54,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:54,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1843439001, now seen corresponding path program 1 times
[2024-11-08 18:13:54,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:54,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340043949]
[2024-11-08 18:13:54,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:54,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:54,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:55,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:55,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:55,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:55,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:55,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:55,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:13:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:55,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:13:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:55,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:13:55,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:55,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-08 18:13:55,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:55,325 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-08 18:13:55,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:55,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340043949]
[2024-11-08 18:13:55,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340043949] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:55,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:55,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 18:13:55,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715118362]
[2024-11-08 18:13:55,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:55,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:13:55,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:55,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:13:55,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:13:55,328 INFO L87 Difference]: Start difference. First operand 798 states and 1101 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-08 18:13:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:55,787 INFO L93 Difference]: Finished difference Result 2053 states and 2823 transitions.
[2024-11-08 18:13:55,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:13:55,788 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 87
[2024-11-08 18:13:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:55,796 INFO L225 Difference]: With dead ends: 2053
[2024-11-08 18:13:55,797 INFO L226 Difference]: Without dead ends: 1368
[2024-11-08 18:13:55,799 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:13:55,799 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 196 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1476 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:55,800 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1476 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 18:13:55,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states.
[2024-11-08 18:13:55,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1082.
[2024-11-08 18:13:55,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 827 states have (on average 1.3724304715840387) internal successors, (1135), 832 states have internal predecessors, (1135), 172 states have call successors, (172), 82 states have call predecessors, (172), 82 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172)
[2024-11-08 18:13:55,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 1479 transitions.
[2024-11-08 18:13:55,914 INFO L78 Accepts]: Start accepts. Automaton has 1082 states and 1479 transitions. Word has length 87
[2024-11-08 18:13:55,915 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:55,915 INFO L471 AbstractCegarLoop]: Abstraction has 1082 states and 1479 transitions.
[2024-11-08 18:13:55,915 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7)
[2024-11-08 18:13:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 1082 states and 1479 transitions.
[2024-11-08 18:13:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92
[2024-11-08 18:13:55,917 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:55,917 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:13:55,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13
[2024-11-08 18:13:55,918 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:55,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1902456290, now seen corresponding path program 1 times
[2024-11-08 18:13:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:55,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016282979]
[2024-11-08 18:13:55,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:55,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:13:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:13:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:13:56,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 18:13:56,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,171 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-08 18:13:56,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:56,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016282979]
[2024-11-08 18:13:56,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016282979] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:56,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:56,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:13:56,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838986022]
[2024-11-08 18:13:56,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:56,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:13:56,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:56,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:13:56,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:13:56,174 INFO L87 Difference]: Start difference. First operand 1082 states and 1479 transitions. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2024-11-08 18:13:56,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:56,346 INFO L93 Difference]: Finished difference Result 2007 states and 2768 transitions.
[2024-11-08 18:13:56,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-08 18:13:56,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 91
[2024-11-08 18:13:56,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:56,355 INFO L225 Difference]: With dead ends: 2007
[2024-11-08 18:13:56,355 INFO L226 Difference]: Without dead ends: 1106
[2024-11-08 18:13:56,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 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-08 18:13:56,360 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 3 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:56,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 763 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2024-11-08 18:13:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states.
[2024-11-08 18:13:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1106.
[2024-11-08 18:13:56,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1106 states, 845 states have (on average 1.3644970414201183) internal successors, (1153), 850 states have internal predecessors, (1153), 172 states have call successors, (172), 88 states have call predecessors, (172), 88 states have return successors, (172), 167 states have call predecessors, (172), 172 states have call successors, (172)
[2024-11-08 18:13:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1106 states to 1106 states and 1497 transitions.
[2024-11-08 18:13:56,484 INFO L78 Accepts]: Start accepts. Automaton has 1106 states and 1497 transitions. Word has length 91
[2024-11-08 18:13:56,484 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:56,485 INFO L471 AbstractCegarLoop]: Abstraction has 1106 states and 1497 transitions.
[2024-11-08 18:13:56,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7)
[2024-11-08 18:13:56,485 INFO L276 IsEmpty]: Start isEmpty. Operand 1106 states and 1497 transitions.
[2024-11-08 18:13:56,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91
[2024-11-08 18:13:56,488 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:56,489 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 18:13:56,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14
[2024-11-08 18:13:56,489 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:56,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:56,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1549914564, now seen corresponding path program 1 times
[2024-11-08 18:13:56,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:56,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478894231]
[2024-11-08 18:13:56,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:56,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:56,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:56,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:13:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:13:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:13:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-08 18:13:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,013 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2024-11-08 18:13:57,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:57,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478894231]
[2024-11-08 18:13:57,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478894231] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:57,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:57,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-08 18:13:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723479485]
[2024-11-08 18:13:57,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:57,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-08 18:13:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:57,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-08 18:13:57,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56
[2024-11-08 18:13:57,018 INFO L87 Difference]: Start difference. First operand 1106 states and 1497 transitions. Second operand has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-08 18:13:57,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:57,366 INFO L93 Difference]: Finished difference Result 1536 states and 2187 transitions.
[2024-11-08 18:13:57,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:13:57,367 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 90
[2024-11-08 18:13:57,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:57,377 INFO L225 Difference]: With dead ends: 1536
[2024-11-08 18:13:57,377 INFO L226 Difference]: Without dead ends: 1534
[2024-11-08 18:13:57,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132
[2024-11-08 18:13:57,379 INFO L432 NwaCegarLoop]: 446 mSDtfsCounter, 271 mSDsluCounter, 2159 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:57,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 2605 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 18:13:57,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states.
[2024-11-08 18:13:57,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1114.
[2024-11-08 18:13:57,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1114 states, 849 states have (on average 1.3627797408716136) internal successors, (1157), 856 states have internal predecessors, (1157), 174 states have call successors, (174), 90 states have call predecessors, (174), 90 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174)
[2024-11-08 18:13:57,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1505 transitions.
[2024-11-08 18:13:57,541 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1505 transitions. Word has length 90
[2024-11-08 18:13:57,542 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:57,542 INFO L471 AbstractCegarLoop]: Abstraction has 1114 states and 1505 transitions.
[2024-11-08 18:13:57,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 3 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-08 18:13:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1505 transitions.
[2024-11-08 18:13:57,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94
[2024-11-08 18:13:57,544 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:57,544 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:13:57,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15
[2024-11-08 18:13:57,545 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:57,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:57,545 INFO L85 PathProgramCache]: Analyzing trace with hash 411784278, now seen corresponding path program 1 times
[2024-11-08 18:13:57,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:57,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737288453]
[2024-11-08 18:13:57,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:57,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:57,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:57,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:57,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:13:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:13:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:13:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-08 18:13:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:57,862 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-08 18:13:57,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:57,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737288453]
[2024-11-08 18:13:57,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737288453] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:57,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:57,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 18:13:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990563203]
[2024-11-08 18:13:57,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:57,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:13:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:57,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:13:57,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:13:57,866 INFO L87 Difference]: Start difference. First operand 1114 states and 1505 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-08 18:13:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:58,246 INFO L93 Difference]: Finished difference Result 2010 states and 2726 transitions.
[2024-11-08 18:13:58,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:13:58,247 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 93
[2024-11-08 18:13:58,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:58,257 INFO L225 Difference]: With dead ends: 2010
[2024-11-08 18:13:58,258 INFO L226 Difference]: Without dead ends: 1159
[2024-11-08 18:13:58,261 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:13:58,262 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 255 mSDsluCounter, 1226 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1485 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:58,263 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1485 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 18:13:58,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states.
[2024-11-08 18:13:58,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1117.
[2024-11-08 18:13:58,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1117 states, 863 states have (on average 1.3534183082271147) internal successors, (1168), 875 states have internal predecessors, (1168), 162 states have call successors, (162), 91 states have call predecessors, (162), 91 states have return successors, (162), 150 states have call predecessors, (162), 162 states have call successors, (162)
[2024-11-08 18:13:58,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1492 transitions.
[2024-11-08 18:13:58,425 INFO L78 Accepts]: Start accepts. Automaton has 1117 states and 1492 transitions. Word has length 93
[2024-11-08 18:13:58,426 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 1117 states and 1492 transitions.
[2024-11-08 18:13:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 6 states have internal predecessors, (69), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7)
[2024-11-08 18:13:58,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1117 states and 1492 transitions.
[2024-11-08 18:13:58,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96
[2024-11-08 18:13:58,431 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:58,432 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:13:58,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16
[2024-11-08 18:13:58,432 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:58,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:58,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1739465235, now seen corresponding path program 1 times
[2024-11-08 18:13:58,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:58,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249941616]
[2024-11-08 18:13:58,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:58,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:58,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:59,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:13:59,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:59,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:13:59,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:59,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:13:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:59,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:13:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:59,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:13:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:59,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:13:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:59,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-08 18:13:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:59,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 18:13:59,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:13:59,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked.
[2024-11-08 18:13:59,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:13:59,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249941616]
[2024-11-08 18:13:59,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249941616] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:13:59,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:13:59,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 18:13:59,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533578999]
[2024-11-08 18:13:59,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:13:59,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:13:59,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:13:59,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:13:59,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:13:59,274 INFO L87 Difference]: Start difference. First operand 1117 states and 1492 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-08 18:13:59,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:13:59,637 INFO L93 Difference]: Finished difference Result 1989 states and 2669 transitions.
[2024-11-08 18:13:59,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states.
[2024-11-08 18:13:59,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 95
[2024-11-08 18:13:59,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:13:59,646 INFO L225 Difference]: With dead ends: 1989
[2024-11-08 18:13:59,647 INFO L226 Difference]: Without dead ends: 1115
[2024-11-08 18:13:59,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:13:59,650 INFO L432 NwaCegarLoop]: 258 mSDtfsCounter, 183 mSDsluCounter, 1211 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 1469 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-08 18:13:59,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 1469 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-08 18:13:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states.
[2024-11-08 18:13:59,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 1008.
[2024-11-08 18:13:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1008 states, 781 states have (on average 1.3559539052496798) internal successors, (1059), 791 states have internal predecessors, (1059), 145 states have call successors, (145), 81 states have call predecessors, (145), 81 states have return successors, (145), 135 states have call predecessors, (145), 145 states have call successors, (145)
[2024-11-08 18:13:59,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1008 states to 1008 states and 1349 transitions.
[2024-11-08 18:13:59,760 INFO L78 Accepts]: Start accepts. Automaton has 1008 states and 1349 transitions. Word has length 95
[2024-11-08 18:13:59,760 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:13:59,760 INFO L471 AbstractCegarLoop]: Abstraction has 1008 states and 1349 transitions.
[2024-11-08 18:13:59,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 6 states have internal predecessors, (68), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-08 18:13:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1008 states and 1349 transitions.
[2024-11-08 18:13:59,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2024-11-08 18:13:59,762 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:13:59,762 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:13:59,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17
[2024-11-08 18:13:59,762 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:13:59,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:13:59,763 INFO L85 PathProgramCache]: Analyzing trace with hash 828978139, now seen corresponding path program 1 times
[2024-11-08 18:13:59,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:13:59,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758050547]
[2024-11-08 18:13:59,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:13:59,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:13:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:00,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:14:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:00,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30
[2024-11-08 18:14:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:00,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46
[2024-11-08 18:14:00,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:00,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51
[2024-11-08 18:14:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:00,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59
[2024-11-08 18:14:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:00,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67
[2024-11-08 18:14:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:00,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74
[2024-11-08 18:14:00,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:00,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82
[2024-11-08 18:14:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:00,548 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 18:14:00,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:14:00,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758050547]
[2024-11-08 18:14:00,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758050547] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:14:00,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:14:00,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 18:14:00,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846532519]
[2024-11-08 18:14:00,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:14:00,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:14:00,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:14:00,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:14:00,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:14:00,551 INFO L87 Difference]: Start difference. First operand 1008 states and 1349 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-08 18:14:01,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:14:01,302 INFO L93 Difference]: Finished difference Result 1920 states and 2556 transitions.
[2024-11-08 18:14:01,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 18:14:01,303 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 96
[2024-11-08 18:14:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:14:01,312 INFO L225 Difference]: With dead ends: 1920
[2024-11-08 18:14:01,312 INFO L226 Difference]: Without dead ends: 1075
[2024-11-08 18:14:01,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:14:01,315 INFO L432 NwaCegarLoop]: 281 mSDtfsCounter, 518 mSDsluCounter, 961 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 524 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 18:14:01,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [524 Valid, 1242 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 18:14:01,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states.
[2024-11-08 18:14:01,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 1024.
[2024-11-08 18:14:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1024 states, 789 states have (on average 1.3333333333333333) internal successors, (1052), 800 states have internal predecessors, (1052), 148 states have call successors, (148), 86 states have call predecessors, (148), 86 states have return successors, (148), 137 states have call predecessors, (148), 148 states have call successors, (148)
[2024-11-08 18:14:01,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1024 states to 1024 states and 1348 transitions.
[2024-11-08 18:14:01,465 INFO L78 Accepts]: Start accepts. Automaton has 1024 states and 1348 transitions. Word has length 96
[2024-11-08 18:14:01,465 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:14:01,465 INFO L471 AbstractCegarLoop]: Abstraction has 1024 states and 1348 transitions.
[2024-11-08 18:14:01,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 6 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8)
[2024-11-08 18:14:01,466 INFO L276 IsEmpty]: Start isEmpty. Operand 1024 states and 1348 transitions.
[2024-11-08 18:14:01,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98
[2024-11-08 18:14:01,467 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:14:01,468 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:14:01,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18
[2024-11-08 18:14:01,468 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:14:01,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:14:01,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1240772495, now seen corresponding path program 1 times
[2024-11-08 18:14:01,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:14:01,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957478845]
[2024-11-08 18:14:01,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:14:01,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:14:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:01,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:14:01,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:01,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:14:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:01,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47
[2024-11-08 18:14:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:01,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52
[2024-11-08 18:14:01,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:01,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:14:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:01,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 18:14:01,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:01,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-08 18:14:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:01,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 18:14:01,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:01,633 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2024-11-08 18:14:01,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:14:01,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957478845]
[2024-11-08 18:14:01,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957478845] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:14:01,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:14:01,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2024-11-08 18:14:01,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510673138]
[2024-11-08 18:14:01,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:14:01,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-08 18:14:01,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:14:01,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-08 18:14:01,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2024-11-08 18:14:01,636 INFO L87 Difference]: Start difference. First operand 1024 states and 1348 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-08 18:14:02,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:14:02,054 INFO L93 Difference]: Finished difference Result 2693 states and 3570 transitions.
[2024-11-08 18:14:02,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2024-11-08 18:14:02,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 97
[2024-11-08 18:14:02,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:14:02,070 INFO L225 Difference]: With dead ends: 2693
[2024-11-08 18:14:02,070 INFO L226 Difference]: Without dead ends: 1883
[2024-11-08 18:14:02,074 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 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-08 18:14:02,075 INFO L432 NwaCegarLoop]: 460 mSDtfsCounter, 201 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1151 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-08 18:14:02,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1151 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-08 18:14:02,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states.
[2024-11-08 18:14:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1768.
[2024-11-08 18:14:02,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1768 states, 1343 states have (on average 1.326880119136262) internal successors, (1782), 1362 states have internal predecessors, (1782), 272 states have call successors, (272), 152 states have call predecessors, (272), 152 states have return successors, (272), 253 states have call predecessors, (272), 272 states have call successors, (272)
[2024-11-08 18:14:02,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1768 states to 1768 states and 2326 transitions.
[2024-11-08 18:14:02,391 INFO L78 Accepts]: Start accepts. Automaton has 1768 states and 2326 transitions. Word has length 97
[2024-11-08 18:14:02,392 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:14:02,392 INFO L471 AbstractCegarLoop]: Abstraction has 1768 states and 2326 transitions.
[2024-11-08 18:14:02,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 3 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-08 18:14:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1768 states and 2326 transitions.
[2024-11-08 18:14:02,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100
[2024-11-08 18:14:02,394 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:14:02,395 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:14:02,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19
[2024-11-08 18:14:02,395 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:14:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:14:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash -2026886842, now seen corresponding path program 1 times
[2024-11-08 18:14:02,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:14:02,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937485552]
[2024-11-08 18:14:02,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:14:02,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:14:02,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:03,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15
[2024-11-08 18:14:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32
[2024-11-08 18:14:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:03,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47
[2024-11-08 18:14:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:03,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52
[2024-11-08 18:14:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:03,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60
[2024-11-08 18:14:03,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:03,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68
[2024-11-08 18:14:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:03,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75
[2024-11-08 18:14:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:03,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83
[2024-11-08 18:14:03,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-08 18:14:03,280 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked.
[2024-11-08 18:14:03,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-08 18:14:03,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937485552]
[2024-11-08 18:14:03,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937485552] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-08 18:14:03,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-08 18:14:03,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-08 18:14:03,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925359223]
[2024-11-08 18:14:03,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-08 18:14:03,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-08 18:14:03,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-08 18:14:03,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-08 18:14:03,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2024-11-08 18:14:03,282 INFO L87 Difference]: Start difference. First operand 1768 states and 2326 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-08 18:14:04,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-08 18:14:04,197 INFO L93 Difference]: Finished difference Result 3436 states and 4520 transitions.
[2024-11-08 18:14:04,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-08 18:14:04,198 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 99
[2024-11-08 18:14:04,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-08 18:14:04,211 INFO L225 Difference]: With dead ends: 3436
[2024-11-08 18:14:04,211 INFO L226 Difference]: Without dead ends: 1964
[2024-11-08 18:14:04,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110
[2024-11-08 18:14:04,217 INFO L432 NwaCegarLoop]: 321 mSDtfsCounter, 521 mSDsluCounter, 1106 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-08 18:14:04,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1427 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-08 18:14:04,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states.
[2024-11-08 18:14:04,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1793.
[2024-11-08 18:14:04,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1793 states, 1355 states have (on average 1.3210332103321034) internal successors, (1790), 1375 states have internal predecessors, (1790), 280 states have call successors, (280), 157 states have call predecessors, (280), 157 states have return successors, (280), 260 states have call predecessors, (280), 280 states have call successors, (280)
[2024-11-08 18:14:04,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2350 transitions.
[2024-11-08 18:14:04,550 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2350 transitions. Word has length 99
[2024-11-08 18:14:04,550 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-08 18:14:04,550 INFO L471 AbstractCegarLoop]: Abstraction has 1793 states and 2350 transitions.
[2024-11-08 18:14:04,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 6 states have internal predecessors, (76), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8)
[2024-11-08 18:14:04,551 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2350 transitions.
[2024-11-08 18:14:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-11-08 18:14:04,553 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-08 18:14:04,553 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:14:04,554 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20
[2024-11-08 18:14:04,554 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-08 18:14:04,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-08 18:14:04,555 INFO L85 PathProgramCache]: Analyzing trace with hash -314074869, now seen corresponding path program 1 times
[2024-11-08 18:14:04,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-08 18:14:04,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930827711]
[2024-11-08 18:14:04,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-08 18:14:04,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-08 18:14:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:14:04,726 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2024-11-08 18:14:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat
[2024-11-08 18:14:04,914 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2024-11-08 18:14:04,915 INFO L325 BasicCegarLoop]: Counterexample is feasible
[2024-11-08 18:14:04,916 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-08 18:14:04,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21
[2024-11-08 18:14:04,922 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-08 18:14:05,104 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-08 18:14:05,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 06:14:05 BoogieIcfgContainer
[2024-11-08 18:14:05,112 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-08 18:14:05,113 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-08 18:14:05,113 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-08 18:14:05,113 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-08 18:14:05,114 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 06:13:46" (3/4) ...
[2024-11-08 18:14:05,115 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample
[2024-11-08 18:14:05,305 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/witness.graphml
[2024-11-08 18:14:05,308 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-08 18:14:05,309 INFO L158 Benchmark]: Toolchain (without parser) took 20652.36ms. Allocated memory was 163.6MB in the beginning and 486.5MB in the end (delta: 323.0MB). Free memory was 129.0MB in the beginning and 215.8MB in the end (delta: -86.9MB). Peak memory consumption was 235.0MB. Max. memory is 16.1GB.
[2024-11-08 18:14:05,310 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 125.8MB. Free memory was 93.7MB in the beginning and 93.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-08 18:14:05,311 INFO L158 Benchmark]: CACSL2BoogieTranslator took 821.71ms. Allocated memory is still 163.6MB. Free memory was 129.0MB in the beginning and 118.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
[2024-11-08 18:14:05,311 INFO L158 Benchmark]: Boogie Procedure Inliner took 102.25ms. Allocated memory is still 163.6MB. Free memory was 118.1MB in the beginning and 115.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-08 18:14:05,312 INFO L158 Benchmark]: Boogie Preprocessor took 136.45ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 109.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
[2024-11-08 18:14:05,312 INFO L158 Benchmark]: RCFGBuilder took 1261.29ms. Allocated memory is still 163.6MB. Free memory was 109.7MB in the beginning and 67.7MB in the end (delta: 42.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
[2024-11-08 18:14:05,312 INFO L158 Benchmark]: TraceAbstraction took 18124.21ms. Allocated memory was 163.6MB in the beginning and 486.5MB in the end (delta: 323.0MB). Free memory was 66.7MB in the beginning and 236.8MB in the end (delta: -170.1MB). Peak memory consumption was 154.9MB. Max. memory is 16.1GB.
[2024-11-08 18:14:05,313 INFO L158 Benchmark]: Witness Printer took 195.83ms. Allocated memory is still 486.5MB. Free memory was 236.8MB in the beginning and 215.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB.
[2024-11-08 18:14:05,315 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.32ms. Allocated memory is still 125.8MB. Free memory was 93.7MB in the beginning and 93.6MB in the end (delta: 118.9kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 821.71ms. Allocated memory is still 163.6MB. Free memory was 129.0MB in the beginning and 118.1MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 102.25ms. Allocated memory is still 163.6MB. Free memory was 118.1MB in the beginning and 115.0MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 136.45ms. Allocated memory is still 163.6MB. Free memory was 115.0MB in the beginning and 109.7MB in the end (delta: 5.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB.
* RCFGBuilder took 1261.29ms. Allocated memory is still 163.6MB. Free memory was 109.7MB in the beginning and 67.7MB in the end (delta: 42.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB.
* TraceAbstraction took 18124.21ms. Allocated memory was 163.6MB in the beginning and 486.5MB in the end (delta: 323.0MB). Free memory was 66.7MB in the beginning and 236.8MB in the end (delta: -170.1MB). Peak memory consumption was 154.9MB. Max. memory is 16.1GB.
* Witness Printer took 195.83ms. Allocated memory is still 486.5MB. Free memory was 236.8MB in the beginning and 215.8MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. 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: 618]: a call to reach_error is reachable
a call to reach_error is reachable
We found a FailurePath:
[L24] msg_t nomsg = (msg_t )-1;
[L25] port_t cs1 ;
[L26] int8_t cs1_old ;
[L27] int8_t cs1_new ;
[L28] port_t cs2 ;
[L29] int8_t cs2_old ;
[L30] int8_t cs2_new ;
[L31] port_t s1s2 ;
[L32] int8_t s1s2_old ;
[L33] int8_t s1s2_new ;
[L34] port_t s1s1 ;
[L35] int8_t s1s1_old ;
[L36] int8_t s1s1_new ;
[L37] port_t s2s1 ;
[L38] int8_t s2s1_old ;
[L39] int8_t s2s1_new ;
[L40] port_t s2s2 ;
[L41] int8_t s2s2_old ;
[L42] int8_t s2s2_new ;
[L43] port_t s1p ;
[L44] int8_t s1p_old ;
[L45] int8_t s1p_new ;
[L46] port_t s2p ;
[L47] int8_t s2p_old ;
[L48] int8_t s2p_new ;
[L51] _Bool side1Failed ;
[L52] _Bool side2Failed ;
[L53] msg_t side1_written ;
[L54] msg_t side2_written ;
[L60] static _Bool side1Failed_History_0 ;
[L61] static _Bool side1Failed_History_1 ;
[L62] static _Bool side1Failed_History_2 ;
[L63] static _Bool side2Failed_History_0 ;
[L64] static _Bool side2Failed_History_1 ;
[L65] static _Bool side2Failed_History_2 ;
[L66] static int8_t active_side_History_0 ;
[L67] static int8_t active_side_History_1 ;
[L68] static int8_t active_side_History_2 ;
[L69] static msg_t manual_selection_History_0 ;
[L70] static msg_t manual_selection_History_1 ;
[L71] static msg_t manual_selection_History_2 ;
VAL [active_side_History_0=0, active_side_History_1=0, active_side_History_2=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L542] int c1 ;
[L543] int i2 ;
[L546] c1 = 0
[L547] side1Failed = __VERIFIER_nondet_bool()
[L548] side2Failed = __VERIFIER_nondet_bool()
[L549] side1_written = __VERIFIER_nondet_char()
[L550] side2_written = __VERIFIER_nondet_char()
[L551] side1Failed_History_0 = __VERIFIER_nondet_bool()
[L552] side1Failed_History_1 = __VERIFIER_nondet_bool()
[L553] side1Failed_History_2 = __VERIFIER_nondet_bool()
[L554] side2Failed_History_0 = __VERIFIER_nondet_bool()
[L555] side2Failed_History_1 = __VERIFIER_nondet_bool()
[L556] side2Failed_History_2 = __VERIFIER_nondet_bool()
[L557] active_side_History_0 = __VERIFIER_nondet_char()
[L558] active_side_History_1 = __VERIFIER_nondet_char()
[L559] active_side_History_2 = __VERIFIER_nondet_char()
[L560] manual_selection_History_0 = __VERIFIER_nondet_char()
[L561] manual_selection_History_1 = __VERIFIER_nondet_char()
[L562] manual_selection_History_2 = __VERIFIER_nondet_char()
[L563] CALL, EXPR init()
[L197] COND FALSE !((int )side1Failed_History_0 != 0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L200] COND FALSE !((int )side2Failed_History_0 != 0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L203] COND FALSE !((int )active_side_History_0 != -2)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L206] COND FALSE !((int )manual_selection_History_0 != 0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L209] COND FALSE !((int )side1Failed_History_1 != 0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L212] COND FALSE !((int )side2Failed_History_1 != 0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L215] COND FALSE !((int )active_side_History_1 != -2)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L218] COND FALSE !((int )manual_selection_History_1 != 0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L221] COND FALSE !((int )side1Failed_History_2 != 0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L224] COND FALSE !((int )side2Failed_History_2 != 0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L227] COND FALSE !((int )active_side_History_2 != -2)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L230] COND FALSE !((int )manual_selection_History_2 != 0)
[L233] return (1);
VAL [\result=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L563] RET, EXPR init()
[L563] i2 = init()
[L564] CALL assume_abort_if_not(i2)
VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L58] COND FALSE !(!cond)
VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L564] RET assume_abort_if_not(i2)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L565] cs1_old = nomsg
[L566] cs1_new = nomsg
[L567] cs2_old = nomsg
[L568] cs2_new = nomsg
[L569] s1s2_old = nomsg
[L570] s1s2_new = nomsg
[L571] s1s1_old = nomsg
[L572] s1s1_new = nomsg
[L573] s2s1_old = nomsg
[L574] s2s1_new = nomsg
[L575] s2s2_old = nomsg
[L576] s2s2_new = nomsg
[L577] s1p_old = nomsg
[L578] s1p_new = nomsg
[L579] s2p_old = nomsg
[L580] s2p_new = nomsg
[L581] i2 = 0
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L582] COND TRUE 1
[L584] CALL Console_task_each_pals_period()
[L251] msg_t manual_selection ;
[L252] char tmp ;
[L255] tmp = __VERIFIER_nondet_char()
[L256] manual_selection = tmp
[L257] CALL write_manual_selection_history(manual_selection)
[L167] manual_selection_History_2 = manual_selection_History_1
[L168] manual_selection_History_1 = manual_selection_History_0
[L169] manual_selection_History_0 = val
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L257] RET write_manual_selection_history(manual_selection)
[L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new
[L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new
[L260] manual_selection = (msg_t )0
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=1, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L584] RET Console_task_each_pals_period()
[L585] CALL Side1_activestandby_task_each_pals_period()
[L266] int8_t side1 ;
[L267] int8_t side2 ;
[L268] msg_t manual_selection ;
[L269] int8_t next_state ;
[L272] side1 = nomsg
[L273] side2 = nomsg
[L274] manual_selection = (msg_t )0
[L275] side1Failed = __VERIFIER_nondet_bool()
[L276] CALL write_side1_failed_history(side1Failed)
[L77] side1Failed_History_2 = side1Failed_History_1
[L78] side1Failed_History_1 = side1Failed_History_0
[L79] side1Failed_History_0 = val
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L276] RET write_side1_failed_history(side1Failed)
[L277] COND FALSE !(\read(side1Failed))
[L284] side1 = s1s1_old
[L285] s1s1_old = nomsg
[L286] side2 = s2s1_old
[L287] s2s1_old = nomsg
[L288] manual_selection = cs1_old
[L289] cs1_old = nomsg
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2=-1, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L290] COND TRUE (int )side1 == (int )side2
[L291] next_state = (int8_t )1
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=0, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new
[L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new
[L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new
[L317] side1_written = next_state
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=1, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L585] RET Side1_activestandby_task_each_pals_period()
[L586] CALL Side2_activestandby_task_each_pals_period()
[L323] int8_t side1 ;
[L324] int8_t side2 ;
[L325] msg_t manual_selection ;
[L326] int8_t next_state ;
[L329] side1 = nomsg
[L330] side2 = nomsg
[L331] manual_selection = (msg_t )0
[L332] side2Failed = __VERIFIER_nondet_bool()
[L333] CALL write_side2_failed_history(side2Failed)
[L107] side2Failed_History_2 = side2Failed_History_1
[L108] side2Failed_History_1 = side2Failed_History_0
[L109] side2Failed_History_0 = val
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L333] RET write_side2_failed_history(side2Failed)
[L334] COND FALSE !(\read(side2Failed))
[L341] side1 = s1s2_old
[L342] s1s2_old = nomsg
[L343] side2 = s2s2_old
[L344] s2s2_old = nomsg
[L345] manual_selection = cs2_old
[L346] cs2_old = nomsg
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L347] COND TRUE (int )side1 == (int )side2
[L348] next_state = (int8_t )1
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=0]
[L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new
[L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new
[L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new
[L374] side2_written = next_state
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L586] RET Side2_activestandby_task_each_pals_period()
[L587] CALL Pendulum_prism_task_each_pals_period()
[L380] int8_t active_side ;
[L381] int8_t tmp ;
[L382] int8_t side1 ;
[L383] int8_t side2 ;
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L386] CALL, EXPR read_active_side_history((unsigned char)0)
VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L148] COND TRUE (int )index == 0
[L149] return (active_side_History_0);
VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L386] RET, EXPR read_active_side_history((unsigned char)0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L386] tmp = read_active_side_history((unsigned char)0)
[L387] active_side = tmp
[L388] side1 = nomsg
[L389] side2 = nomsg
[L390] side1 = s1p_old
[L391] s1p_old = nomsg
[L392] side2 = s2p_old
[L393] s2p_old = nomsg
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L394] COND FALSE !((int )side1 == 1)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L397] COND FALSE !((int )side2 == 1)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L400] COND FALSE !((int )side1 == 0)
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L408] COND TRUE (int )side1 == (int )nomsg
VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2=-1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L409] COND FALSE !((int )side2 == 0)
[L412] active_side = (int8_t )0
VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L417] CALL write_active_side_history(active_side)
[L137] active_side_History_2 = active_side_History_1
[L138] active_side_History_1 = active_side_History_0
[L139] active_side_History_0 = val
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L417] RET write_active_side_history(active_side)
[L587] RET Pendulum_prism_task_each_pals_period()
[L588] cs1_old = cs1_new
[L589] cs1_new = nomsg
[L590] cs2_old = cs2_new
[L591] cs2_new = nomsg
[L592] s1s2_old = s1s2_new
[L593] s1s2_new = nomsg
[L594] s1s1_old = s1s1_new
[L595] s1s1_new = nomsg
[L596] s2s1_old = s2s1_new
[L597] s2s1_new = nomsg
[L598] s2s2_old = s2s2_new
[L599] s2s2_new = nomsg
[L600] s1p_old = s1p_new
[L601] s1p_new = nomsg
[L602] s2p_old = s2p_new
[L603] s2p_new = nomsg
[L604] CALL, EXPR check()
[L423] int tmp ;
[L424] msg_t tmp___0 ;
[L425] _Bool tmp___1 ;
[L426] _Bool tmp___2 ;
[L427] _Bool tmp___3 ;
[L428] _Bool tmp___4 ;
[L429] int8_t tmp___5 ;
[L430] _Bool tmp___6 ;
[L431] _Bool tmp___7 ;
[L432] _Bool tmp___8 ;
[L433] int8_t tmp___9 ;
[L434] _Bool tmp___10 ;
[L435] _Bool tmp___11 ;
[L436] _Bool tmp___12 ;
[L437] msg_t tmp___13 ;
[L438] _Bool tmp___14 ;
[L439] _Bool tmp___15 ;
[L440] _Bool tmp___16 ;
[L441] _Bool tmp___17 ;
[L442] int8_t tmp___18 ;
[L443] int8_t tmp___19 ;
[L444] int8_t tmp___20 ;
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L447] COND TRUE ! side1Failed
[L448] tmp = 1
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L455] CALL assume_abort_if_not((_Bool )tmp)
VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L58] COND FALSE !(!cond)
VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L455] RET assume_abort_if_not((_Bool )tmp)
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L456] CALL, EXPR read_manual_selection_history((unsigned char)1)
VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L178] COND FALSE !((int )index == 0)
VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L181] COND TRUE (int )index == 1
[L182] return (manual_selection_History_1);
VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L456] RET, EXPR read_manual_selection_history((unsigned char)1)
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L456] tmp___0 = read_manual_selection_history((unsigned char)1)
[L457] COND TRUE ! tmp___0
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L458] CALL, EXPR read_side1_failed_history((unsigned char)1)
VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L88] COND FALSE !((int )index == 0)
VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L91] COND TRUE (int )index == 1
[L92] return (side1Failed_History_1);
VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L458] RET, EXPR read_side1_failed_history((unsigned char)1)
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L458] tmp___1 = read_side1_failed_history((unsigned char)1)
[L459] COND TRUE ! tmp___1
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L460] CALL, EXPR read_side1_failed_history((unsigned char)0)
VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L88] COND TRUE (int )index == 0
[L89] return (side1Failed_History_0);
VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L460] RET, EXPR read_side1_failed_history((unsigned char)0)
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L460] tmp___2 = read_side1_failed_history((unsigned char)0)
[L461] COND TRUE ! tmp___2
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L462] CALL, EXPR read_side2_failed_history((unsigned char)1)
VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L118] COND FALSE !((int )index == 0)
VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L121] COND TRUE (int )index == 1
[L122] return (side2Failed_History_1);
VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L462] RET, EXPR read_side2_failed_history((unsigned char)1)
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L462] tmp___3 = read_side2_failed_history((unsigned char)1)
[L463] COND TRUE ! tmp___3
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L464] CALL, EXPR read_side2_failed_history((unsigned char)0)
VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L118] COND TRUE (int )index == 0
[L119] return (side2Failed_History_0);
VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L464] RET, EXPR read_side2_failed_history((unsigned char)0)
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L464] tmp___4 = read_side2_failed_history((unsigned char)0)
[L465] COND TRUE ! tmp___4
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L466] COND FALSE !(! ((int )side1_written == 1))
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L471] COND FALSE !(! (! ((int )side1_written == 0)))
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L476] COND TRUE ! (! ((int )side1_written == 1))
VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L477] COND TRUE ! ((int )side2_written == 0)
[L478] return (0);
VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1, tmp=1]
[L604] RET, EXPR check()
[L604] c1 = check()
[L605] CALL assert(c1)
VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L616] COND TRUE ! arg
VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
[L618] reach_error()
VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side1_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, side2_written=1]
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 8 procedures, 180 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.8s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3440 SdHoareTripleChecker+Valid, 2.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3394 mSDsluCounter, 20839 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 14969 mSDsCounter, 222 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1201 IncrementalHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 222 mSolverCounterUnsat, 5870 mSDtfsCounter, 1201 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 363 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1793occurred in iteration=21, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 21 MinimizatonAttempts, 1231 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 1591 NumberOfCodeBlocks, 1591 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1469 ConstructedInterpolants, 0 QuantifiedInterpolants, 3289 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 147/147 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be incorrect!
[2024-11-08 18:14:05,365 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6c5f38f1-5465-48ad-997f-b0889e6b558a/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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