./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc 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_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya --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 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:32:46,031 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:32:46,102 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:32:46,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:32:46,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:32:46,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:32:46,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:32:46,133 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:32:46,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:32:46,134 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:32:46,134 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:32:46,135 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:32:46,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:32:46,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:32:46,137 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:32:46,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:32:46,138 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:32:46,138 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:32:46,139 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:32:46,139 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:32:46,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:32:46,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:32:46,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:32:46,142 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:32:46,142 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:32:46,142 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:32:46,143 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:32:46,143 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:32:46,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:32:46,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:32:46,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:32:46,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:32:46,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:32:46,145 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:32:46,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:32:46,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:32:46,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:32:46,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:32:46,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:32:46,147 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:32:46,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:32:46,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:32:46,148 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_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/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_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 7f4008cf19548475d4a1b90b2fc9651e21c073e156065e130bea6b81023185c5 [2023-11-29 05:32:46,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:32:46,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:32:46,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:32:46,391 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:32:46,392 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:32:46,393 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2023-11-29 05:32:49,141 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:32:49,348 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:32:49,349 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2023-11-29 05:32:49,361 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/data/807191fc2/d21dc6479b834f35920610a25b38cb5c/FLAGdf2c378a6 [2023-11-29 05:32:49,375 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/data/807191fc2/d21dc6479b834f35920610a25b38cb5c [2023-11-29 05:32:49,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:32:49,379 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:32:49,381 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:32:49,381 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:32:49,386 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:32:49,386 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,387 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1242e2e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49, skipping insertion in model container [2023-11-29 05:32:49,388 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:32:49,635 WARN L240 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_65d247c9-cfec-485f-8a34-4729b633153c/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2023-11-29 05:32:49,640 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:32:49,650 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:32:49,704 WARN L240 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_65d247c9-cfec-485f-8a34-4729b633153c/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c[12020,12033] [2023-11-29 05:32:49,704 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:32:49,721 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:32:49,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49 WrapperNode [2023-11-29 05:32:49,722 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:32:49,723 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:32:49,723 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:32:49,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:32:49,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,742 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,774 INFO L138 Inliner]: procedures = 28, calls = 51, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 404 [2023-11-29 05:32:49,775 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:32:49,775 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:32:49,776 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:32:49,776 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:32:49,787 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,788 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,792 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,809 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]. [2023-11-29 05:32:49,810 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,810 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,828 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,850 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,853 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,857 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:32:49,858 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:32:49,858 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:32:49,858 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:32:49,859 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (1/1) ... [2023-11-29 05:32:49,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:32:49,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:32:49,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:32:49,889 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:32:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:32:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2023-11-29 05:32:49,911 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2023-11-29 05:32:49,911 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2023-11-29 05:32:49,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2023-11-29 05:32:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2023-11-29 05:32:49,912 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2023-11-29 05:32:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2023-11-29 05:32:49,912 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2023-11-29 05:32:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2023-11-29 05:32:49,912 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2023-11-29 05:32:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:32:49,912 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:32:49,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:32:49,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:32:49,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:32:50,003 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:32:50,005 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:32:50,416 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:32:50,448 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:32:50,449 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 05:32:50,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:32:50 BoogieIcfgContainer [2023-11-29 05:32:50,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:32:50,452 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:32:50,452 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:32:50,455 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:32:50,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:32:49" (1/3) ... [2023-11-29 05:32:50,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c410b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:32:50, skipping insertion in model container [2023-11-29 05:32:50,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:32:49" (2/3) ... [2023-11-29 05:32:50,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c410b74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:32:50, skipping insertion in model container [2023-11-29 05:32:50,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:32:50" (3/3) ... [2023-11-29 05:32:50,458 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.UNBOUNDED.pals.c [2023-11-29 05:32:50,476 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:32:50,476 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:32:50,524 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:32:50,530 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=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;@416a7b32, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:32:50,531 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:32:50,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 134 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-29 05:32:50,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 05:32:50,543 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:50,544 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:50,544 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:50,550 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:50,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1165195423, now seen corresponding path program 1 times [2023-11-29 05:32:50,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:50,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582771979] [2023-11-29 05:32:50,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:50,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:32:50,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:50,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582771979] [2023-11-29 05:32:50,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582771979] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:50,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:50,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706292710] [2023-11-29 05:32:50,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:50,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:50,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:50,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:50,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:50,825 INFO L87 Difference]: Start difference. First operand has 174 states, 129 states have (on average 1.6046511627906976) internal successors, (207), 134 states have internal predecessors, (207), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:32:50,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:50,949 INFO L93 Difference]: Finished difference Result 352 states and 610 transitions. [2023-11-29 05:32:50,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:50,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 05:32:50,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:50,963 INFO L225 Difference]: With dead ends: 352 [2023-11-29 05:32:50,963 INFO L226 Difference]: Without dead ends: 180 [2023-11-29 05:32:50,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:50,973 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 18 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:50,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 787 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-29 05:32:51,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2023-11-29 05:32:51,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 133 states have (on average 1.5639097744360901) internal successors, (208), 137 states have internal predecessors, (208), 37 states have call successors, (37), 7 states have call predecessors, (37), 7 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2023-11-29 05:32:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 282 transitions. [2023-11-29 05:32:51,034 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 282 transitions. Word has length 14 [2023-11-29 05:32:51,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:51,035 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 282 transitions. [2023-11-29 05:32:51,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:32:51,035 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 282 transitions. [2023-11-29 05:32:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 05:32:51,037 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:51,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:51,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:32:51,038 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:51,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:51,039 INFO L85 PathProgramCache]: Analyzing trace with hash 579778909, now seen corresponding path program 1 times [2023-11-29 05:32:51,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:51,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394447372] [2023-11-29 05:32:51,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:51,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:32:51,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:51,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394447372] [2023-11-29 05:32:51,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394447372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:51,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920215089] [2023-11-29 05:32:51,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:51,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:51,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:51,112 INFO L87 Difference]: Start difference. First operand 178 states and 282 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:32:51,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:51,174 INFO L93 Difference]: Finished difference Result 370 states and 588 transitions. [2023-11-29 05:32:51,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:51,175 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 05:32:51,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:51,178 INFO L225 Difference]: With dead ends: 370 [2023-11-29 05:32:51,178 INFO L226 Difference]: Without dead ends: 194 [2023-11-29 05:32:51,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:51,181 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 25 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 807 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.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:51,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 807 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:51,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-29 05:32:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2023-11-29 05:32:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 144 states have (on average 1.5416666666666667) internal successors, (222), 148 states have internal predecessors, (222), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 05:32:51,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 298 transitions. [2023-11-29 05:32:51,201 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 298 transitions. Word has length 15 [2023-11-29 05:32:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:51,201 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 298 transitions. [2023-11-29 05:32:51,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:32:51,202 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 298 transitions. [2023-11-29 05:32:51,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 05:32:51,203 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:51,204 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:51,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:32:51,204 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:51,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:51,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1957244647, now seen corresponding path program 1 times [2023-11-29 05:32:51,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:51,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567868975] [2023-11-29 05:32:51,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:51,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:51,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:51,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:32:51,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:51,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567868975] [2023-11-29 05:32:51,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567868975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:51,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:51,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:32:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545106272] [2023-11-29 05:32:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:51,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:32:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:51,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:32:51,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:32:51,279 INFO L87 Difference]: Start difference. First operand 191 states and 298 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:32:51,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:51,308 INFO L93 Difference]: Finished difference Result 402 states and 634 transitions. [2023-11-29 05:32:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:32:51,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-11-29 05:32:51,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:51,319 INFO L225 Difference]: With dead ends: 402 [2023-11-29 05:32:51,319 INFO L226 Difference]: Without dead ends: 220 [2023-11-29 05:32:51,320 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:32:51,321 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 22 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:51,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 542 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:51,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-29 05:32:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 193. [2023-11-29 05:32:51,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5342465753424657) internal successors, (224), 150 states have internal predecessors, (224), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 05:32:51,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 300 transitions. [2023-11-29 05:32:51,339 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 300 transitions. Word has length 23 [2023-11-29 05:32:51,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:51,340 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 300 transitions. [2023-11-29 05:32:51,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-29 05:32:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 300 transitions. [2023-11-29 05:32:51,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 05:32:51,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:51,342 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:51,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:32:51,343 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:51,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:51,343 INFO L85 PathProgramCache]: Analyzing trace with hash 784621896, now seen corresponding path program 1 times [2023-11-29 05:32:51,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:51,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494505542] [2023-11-29 05:32:51,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:51,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:51,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:32:51,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:51,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494505542] [2023-11-29 05:32:51,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494505542] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:51,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:51,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:32:51,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588508604] [2023-11-29 05:32:51,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:51,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:32:51,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:51,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:32:51,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:51,451 INFO L87 Difference]: Start difference. First operand 193 states and 300 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:32:51,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:51,493 INFO L93 Difference]: Finished difference Result 378 states and 591 transitions. [2023-11-29 05:32:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:51,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2023-11-29 05:32:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:51,496 INFO L225 Difference]: With dead ends: 378 [2023-11-29 05:32:51,496 INFO L226 Difference]: Without dead ends: 200 [2023-11-29 05:32:51,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:51,498 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 1 mSDsluCounter, 808 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1080 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:51,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1080 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:51,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2023-11-29 05:32:51,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 197. [2023-11-29 05:32:51,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 149 states have (on average 1.523489932885906) internal successors, (227), 153 states have internal predecessors, (227), 38 states have call successors, (38), 8 states have call predecessors, (38), 9 states have return successors, (39), 39 states have call predecessors, (39), 38 states have call successors, (39) [2023-11-29 05:32:51,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 304 transitions. [2023-11-29 05:32:51,512 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 304 transitions. Word has length 31 [2023-11-29 05:32:51,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:51,513 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 304 transitions. [2023-11-29 05:32:51,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 4 states have internal predecessors, (24), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:32:51,513 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 304 transitions. [2023-11-29 05:32:51,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:32:51,515 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:51,515 INFO L195 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] [2023-11-29 05:32:51,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:32:51,515 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:51,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:51,516 INFO L85 PathProgramCache]: Analyzing trace with hash -64301629, now seen corresponding path program 1 times [2023-11-29 05:32:51,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:51,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441874807] [2023-11-29 05:32:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:51,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:51,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:32:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:32:51,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:51,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441874807] [2023-11-29 05:32:51,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441874807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:51,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:51,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:32:51,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683007590] [2023-11-29 05:32:51,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:51,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:32:51,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:51,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:32:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:32:51,616 INFO L87 Difference]: Start difference. First operand 197 states and 304 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:32:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:51,703 INFO L93 Difference]: Finished difference Result 340 states and 531 transitions. [2023-11-29 05:32:51,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:32:51,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 34 [2023-11-29 05:32:51,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:51,706 INFO L225 Difference]: With dead ends: 340 [2023-11-29 05:32:51,706 INFO L226 Difference]: Without dead ends: 193 [2023-11-29 05:32:51,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:32:51,708 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 117 mSDsluCounter, 910 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:51,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1176 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-11-29 05:32:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2023-11-29 05:32:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 146 states have (on average 1.5) internal successors, (219), 150 states have internal predecessors, (219), 38 states have call successors, (38), 8 states have call predecessors, (38), 8 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 05:32:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 295 transitions. [2023-11-29 05:32:51,735 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 295 transitions. Word has length 34 [2023-11-29 05:32:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:51,735 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 295 transitions. [2023-11-29 05:32:51,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-11-29 05:32:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 295 transitions. [2023-11-29 05:32:51,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 05:32:51,737 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:51,737 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:51,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:32:51,738 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:51,738 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:51,738 INFO L85 PathProgramCache]: Analyzing trace with hash 972312280, now seen corresponding path program 1 times [2023-11-29 05:32:51,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:51,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224990428] [2023-11-29 05:32:51,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:51,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:32:51,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224990428] [2023-11-29 05:32:51,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224990428] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:32:51,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662526855] [2023-11-29 05:32:51,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:51,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:32:51,820 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:32:51,821 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:32:51,828 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 05:32:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:51,924 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:32:51,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:32:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:32:51,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:32:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:32:52,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662526855] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:32:52,017 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:32:52,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2023-11-29 05:32:52,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536025077] [2023-11-29 05:32:52,018 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:32:52,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:32:52,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:52,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:32:52,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:52,020 INFO L87 Difference]: Start difference. First operand 193 states and 295 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:32:52,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:52,081 INFO L93 Difference]: Finished difference Result 435 states and 678 transitions. [2023-11-29 05:32:52,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:52,082 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2023-11-29 05:32:52,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:52,084 INFO L225 Difference]: With dead ends: 435 [2023-11-29 05:32:52,084 INFO L226 Difference]: Without dead ends: 252 [2023-11-29 05:32:52,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:52,087 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 91 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 555 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:52,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 555 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:52,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-11-29 05:32:52,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 246. [2023-11-29 05:32:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 189 states have (on average 1.470899470899471) internal successors, (278), 193 states have internal predecessors, (278), 48 states have call successors, (48), 8 states have call predecessors, (48), 8 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-11-29 05:32:52,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 374 transitions. [2023-11-29 05:32:52,106 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 374 transitions. Word has length 34 [2023-11-29 05:32:52,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:52,106 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 374 transitions. [2023-11-29 05:32:52,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-29 05:32:52,107 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 374 transitions. [2023-11-29 05:32:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 05:32:52,108 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:52,108 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:52,116 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 05:32:52,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-29 05:32:52,310 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:52,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:52,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1882466360, now seen corresponding path program 2 times [2023-11-29 05:32:52,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:52,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532370089] [2023-11-29 05:32:52,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:52,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:52,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:52,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,380 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-11-29 05:32:52,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:52,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532370089] [2023-11-29 05:32:52,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532370089] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:52,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:52,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:52,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802786267] [2023-11-29 05:32:52,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:52,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:52,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:52,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:52,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:52,383 INFO L87 Difference]: Start difference. First operand 246 states and 374 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:32:52,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:52,434 INFO L93 Difference]: Finished difference Result 503 states and 775 transitions. [2023-11-29 05:32:52,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:52,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2023-11-29 05:32:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:52,437 INFO L225 Difference]: With dead ends: 503 [2023-11-29 05:32:52,437 INFO L226 Difference]: Without dead ends: 285 [2023-11-29 05:32:52,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:52,439 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 24 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:52,439 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 799 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-11-29 05:32:52,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 282. [2023-11-29 05:32:52,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 221 states have (on average 1.4253393665158371) internal successors, (315), 225 states have internal predecessors, (315), 51 states have call successors, (51), 9 states have call predecessors, (51), 9 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-29 05:32:52,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 417 transitions. [2023-11-29 05:32:52,457 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 417 transitions. Word has length 56 [2023-11-29 05:32:52,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:52,457 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 417 transitions. [2023-11-29 05:32:52,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:32:52,458 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 417 transitions. [2023-11-29 05:32:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-11-29 05:32:52,458 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:52,459 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:52,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:32:52,459 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:52,459 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:52,459 INFO L85 PathProgramCache]: Analyzing trace with hash 431791273, now seen corresponding path program 1 times [2023-11-29 05:32:52,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:52,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892579574] [2023-11-29 05:32:52,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:52,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:52,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:52,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:52,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:52,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:52,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,523 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-29 05:32:52,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:52,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892579574] [2023-11-29 05:32:52,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892579574] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:52,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:52,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373360651] [2023-11-29 05:32:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:52,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:52,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:52,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:52,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:52,526 INFO L87 Difference]: Start difference. First operand 282 states and 417 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:32:52,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:52,582 INFO L93 Difference]: Finished difference Result 540 states and 822 transitions. [2023-11-29 05:32:52,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:52,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 56 [2023-11-29 05:32:52,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:52,585 INFO L225 Difference]: With dead ends: 540 [2023-11-29 05:32:52,585 INFO L226 Difference]: Without dead ends: 291 [2023-11-29 05:32:52,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:52,587 INFO L413 NwaCegarLoop]: 268 mSDtfsCounter, 19 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:52,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 786 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:52,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-11-29 05:32:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2023-11-29 05:32:52,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.422907488986784) internal successors, (323), 231 states have internal predecessors, (323), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-29 05:32:52,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 425 transitions. [2023-11-29 05:32:52,624 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 425 transitions. Word has length 56 [2023-11-29 05:32:52,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:52,625 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 425 transitions. [2023-11-29 05:32:52,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 3 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-11-29 05:32:52,625 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 425 transitions. [2023-11-29 05:32:52,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2023-11-29 05:32:52,626 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:52,626 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:52,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:32:52,626 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:52,627 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:52,627 INFO L85 PathProgramCache]: Analyzing trace with hash -349947768, now seen corresponding path program 1 times [2023-11-29 05:32:52,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:52,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389831708] [2023-11-29 05:32:52,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:52,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:52,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:52,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:52,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,718 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2023-11-29 05:32:52,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:52,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389831708] [2023-11-29 05:32:52,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389831708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:52,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:52,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:32:52,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717585052] [2023-11-29 05:32:52,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:52,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:32:52,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:52,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:32:52,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:52,721 INFO L87 Difference]: Start difference. First operand 289 states and 425 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:32:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:52,756 INFO L93 Difference]: Finished difference Result 528 states and 790 transitions. [2023-11-29 05:32:52,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:52,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 74 [2023-11-29 05:32:52,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:52,760 INFO L225 Difference]: With dead ends: 528 [2023-11-29 05:32:52,760 INFO L226 Difference]: Without dead ends: 291 [2023-11-29 05:32:52,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:52,762 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 0 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:52,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1067 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:52,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-11-29 05:32:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2023-11-29 05:32:52,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 227 states have (on average 1.4096916299559472) internal successors, (320), 231 states have internal predecessors, (320), 51 states have call successors, (51), 10 states have call predecessors, (51), 10 states have return successors, (51), 51 states have call predecessors, (51), 51 states have call successors, (51) [2023-11-29 05:32:52,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 422 transitions. [2023-11-29 05:32:52,776 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 422 transitions. Word has length 74 [2023-11-29 05:32:52,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:52,776 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 422 transitions. [2023-11-29 05:32:52,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:32:52,776 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 422 transitions. [2023-11-29 05:32:52,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-29 05:32:52,777 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:52,777 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:52,778 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:32:52,778 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:52,778 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:52,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1852005032, now seen corresponding path program 1 times [2023-11-29 05:32:52,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:52,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262806057] [2023-11-29 05:32:52,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:52,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:52,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:52,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2023-11-29 05:32:52,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:52,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262806057] [2023-11-29 05:32:52,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262806057] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:52,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:52,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:52,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653753527] [2023-11-29 05:32:52,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:52,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:52,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:52,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:52,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:52,881 INFO L87 Difference]: Start difference. First operand 289 states and 422 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:32:52,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:52,942 INFO L93 Difference]: Finished difference Result 565 states and 846 transitions. [2023-11-29 05:32:52,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:52,942 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 103 [2023-11-29 05:32:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:52,945 INFO L225 Difference]: With dead ends: 565 [2023-11-29 05:32:52,945 INFO L226 Difference]: Without dead ends: 333 [2023-11-29 05:32:52,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:52,947 INFO L413 NwaCegarLoop]: 274 mSDtfsCounter, 25 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:52,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 799 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:52,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-11-29 05:32:52,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 330. [2023-11-29 05:32:52,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 264 states have (on average 1.371212121212121) internal successors, (362), 268 states have internal predecessors, (362), 54 states have call successors, (54), 11 states have call predecessors, (54), 11 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 05:32:52,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 470 transitions. [2023-11-29 05:32:52,967 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 470 transitions. Word has length 103 [2023-11-29 05:32:52,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:52,967 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 470 transitions. [2023-11-29 05:32:52,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:32:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 470 transitions. [2023-11-29 05:32:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 05:32:52,969 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:52,969 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:52,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:32:52,969 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:52,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:52,970 INFO L85 PathProgramCache]: Analyzing trace with hash 497991807, now seen corresponding path program 1 times [2023-11-29 05:32:52,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:52,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772866835] [2023-11-29 05:32:52,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:52,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:53,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:53,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:53,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2023-11-29 05:32:53,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:53,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772866835] [2023-11-29 05:32:53,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772866835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:53,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:53,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:53,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446912484] [2023-11-29 05:32:53,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:53,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:53,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:53,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:53,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:53,077 INFO L87 Difference]: Start difference. First operand 330 states and 470 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:32:53,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:53,135 INFO L93 Difference]: Finished difference Result 591 states and 866 transitions. [2023-11-29 05:32:53,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:32:53,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2023-11-29 05:32:53,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:53,138 INFO L225 Difference]: With dead ends: 591 [2023-11-29 05:32:53,138 INFO L226 Difference]: Without dead ends: 324 [2023-11-29 05:32:53,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:53,140 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 15 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:53,140 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 759 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:53,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2023-11-29 05:32:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2023-11-29 05:32:53,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 259 states have (on average 1.3513513513513513) internal successors, (350), 263 states have internal predecessors, (350), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-29 05:32:53,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 456 transitions. [2023-11-29 05:32:53,158 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 456 transitions. Word has length 104 [2023-11-29 05:32:53,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:53,159 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 456 transitions. [2023-11-29 05:32:53,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2023-11-29 05:32:53,159 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 456 transitions. [2023-11-29 05:32:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-11-29 05:32:53,161 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:53,161 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:53,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:32:53,161 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:53,162 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:53,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1261568454, now seen corresponding path program 1 times [2023-11-29 05:32:53,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:53,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011646695] [2023-11-29 05:32:53,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:53,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:53,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:53,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:53,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:53,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,287 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2023-11-29 05:32:53,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:53,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011646695] [2023-11-29 05:32:53,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011646695] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:53,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:53,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:32:53,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116163567] [2023-11-29 05:32:53,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:53,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:32:53,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:53,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:32:53,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:53,289 INFO L87 Difference]: Start difference. First operand 324 states and 456 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:32:53,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:53,325 INFO L93 Difference]: Finished difference Result 566 states and 815 transitions. [2023-11-29 05:32:53,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:53,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 123 [2023-11-29 05:32:53,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:53,329 INFO L225 Difference]: With dead ends: 566 [2023-11-29 05:32:53,329 INFO L226 Difference]: Without dead ends: 326 [2023-11-29 05:32:53,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:53,330 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 0 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:53,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1051 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2023-11-29 05:32:53,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2023-11-29 05:32:53,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 259 states have (on average 1.3397683397683398) internal successors, (347), 263 states have internal predecessors, (347), 53 states have call successors, (53), 11 states have call predecessors, (53), 11 states have return successors, (53), 53 states have call predecessors, (53), 53 states have call successors, (53) [2023-11-29 05:32:53,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 453 transitions. [2023-11-29 05:32:53,349 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 453 transitions. Word has length 123 [2023-11-29 05:32:53,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:53,350 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 453 transitions. [2023-11-29 05:32:53,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:32:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 453 transitions. [2023-11-29 05:32:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2023-11-29 05:32:53,352 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:53,352 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:53,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:32:53,352 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:53,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:53,353 INFO L85 PathProgramCache]: Analyzing trace with hash -25377946, now seen corresponding path program 1 times [2023-11-29 05:32:53,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:53,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919409759] [2023-11-29 05:32:53,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:53,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:53,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:53,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:53,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:53,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:53,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2023-11-29 05:32:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919409759] [2023-11-29 05:32:53,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919409759] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:53,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:53,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857605943] [2023-11-29 05:32:53,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:53,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:53,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:53,496 INFO L87 Difference]: Start difference. First operand 324 states and 453 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:32:53,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:53,565 INFO L93 Difference]: Finished difference Result 529 states and 775 transitions. [2023-11-29 05:32:53,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:32:53,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 156 [2023-11-29 05:32:53,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:53,568 INFO L225 Difference]: With dead ends: 529 [2023-11-29 05:32:53,568 INFO L226 Difference]: Without dead ends: 322 [2023-11-29 05:32:53,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:53,570 INFO L413 NwaCegarLoop]: 249 mSDtfsCounter, 13 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:53,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 727 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:53,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2023-11-29 05:32:53,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 322. [2023-11-29 05:32:53,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 258 states have (on average 1.3372093023255813) internal successors, (345), 262 states have internal predecessors, (345), 52 states have call successors, (52), 11 states have call predecessors, (52), 11 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-29 05:32:53,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 449 transitions. [2023-11-29 05:32:53,588 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 449 transitions. Word has length 156 [2023-11-29 05:32:53,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:53,588 INFO L495 AbstractCegarLoop]: Abstraction has 322 states and 449 transitions. [2023-11-29 05:32:53,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-29 05:32:53,588 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 449 transitions. [2023-11-29 05:32:53,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 05:32:53,591 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:53,591 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:53,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:32:53,591 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:53,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash -93490958, now seen corresponding path program 1 times [2023-11-29 05:32:53,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:53,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737591619] [2023-11-29 05:32:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:53,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:53,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:53,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:53,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:53,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:53,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:53,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:53,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:53,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:53,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:53,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:53,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:53,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:53,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:53,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2023-11-29 05:32:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,765 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2023-11-29 05:32:53,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:53,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737591619] [2023-11-29 05:32:53,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737591619] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:53,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:53,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:53,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988215620] [2023-11-29 05:32:53,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:53,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:53,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:53,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:53,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:53,768 INFO L87 Difference]: Start difference. First operand 322 states and 449 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:32:53,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:53,845 INFO L93 Difference]: Finished difference Result 469 states and 671 transitions. [2023-11-29 05:32:53,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:53,845 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 175 [2023-11-29 05:32:53,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:53,848 INFO L225 Difference]: With dead ends: 469 [2023-11-29 05:32:53,848 INFO L226 Difference]: Without dead ends: 305 [2023-11-29 05:32:53,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:53,849 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 35 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:53,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 708 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:53,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-11-29 05:32:53,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2023-11-29 05:32:53,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 244 states have (on average 1.3278688524590163) internal successors, (324), 248 states have internal predecessors, (324), 49 states have call successors, (49), 11 states have call predecessors, (49), 11 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2023-11-29 05:32:53,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2023-11-29 05:32:53,867 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 175 [2023-11-29 05:32:53,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:53,868 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2023-11-29 05:32:53,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:32:53,868 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2023-11-29 05:32:53,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-29 05:32:53,870 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:53,871 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:53,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:32:53,871 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:53,871 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:53,871 INFO L85 PathProgramCache]: Analyzing trace with hash -1448764403, now seen corresponding path program 1 times [2023-11-29 05:32:53,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:53,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894614765] [2023-11-29 05:32:53,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:53,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:53,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:53,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:53,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:53,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:53,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:54,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:54,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:54,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:54,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 05:32:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2023-11-29 05:32:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894614765] [2023-11-29 05:32:54,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894614765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:54,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:54,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:54,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857127113] [2023-11-29 05:32:54,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:54,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:54,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:54,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:54,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:54,048 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:32:54,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:54,117 INFO L93 Difference]: Finished difference Result 452 states and 644 transitions. [2023-11-29 05:32:54,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:54,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 177 [2023-11-29 05:32:54,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:54,120 INFO L225 Difference]: With dead ends: 452 [2023-11-29 05:32:54,120 INFO L226 Difference]: Without dead ends: 286 [2023-11-29 05:32:54,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:54,122 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 30 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:54,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 712 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:54,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-11-29 05:32:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2023-11-29 05:32:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.3201754385964912) internal successors, (301), 232 states have internal predecessors, (301), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 05:32:54,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 393 transitions. [2023-11-29 05:32:54,139 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 393 transitions. Word has length 177 [2023-11-29 05:32:54,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:54,140 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 393 transitions. [2023-11-29 05:32:54,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2023-11-29 05:32:54,140 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 393 transitions. [2023-11-29 05:32:54,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2023-11-29 05:32:54,143 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:54,143 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:54,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:32:54,143 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:54,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:54,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1265191700, now seen corresponding path program 1 times [2023-11-29 05:32:54,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:54,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340872452] [2023-11-29 05:32:54,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:54,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:54,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:54,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:54,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:32:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2023-11-29 05:32:54,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,319 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2023-11-29 05:32:54,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:54,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340872452] [2023-11-29 05:32:54,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340872452] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:54,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:54,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:32:54,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661100135] [2023-11-29 05:32:54,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:54,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:32:54,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:54,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:32:54,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:54,321 INFO L87 Difference]: Start difference. First operand 286 states and 393 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 05:32:54,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:54,354 INFO L93 Difference]: Finished difference Result 432 states and 614 transitions. [2023-11-29 05:32:54,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:54,355 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 178 [2023-11-29 05:32:54,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:54,357 INFO L225 Difference]: With dead ends: 432 [2023-11-29 05:32:54,357 INFO L226 Difference]: Without dead ends: 286 [2023-11-29 05:32:54,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:54,359 INFO L413 NwaCegarLoop]: 259 mSDtfsCounter, 0 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1029 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:54,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1029 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:54,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-11-29 05:32:54,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2023-11-29 05:32:54,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 228 states have (on average 1.293859649122807) internal successors, (295), 232 states have internal predecessors, (295), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 05:32:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 387 transitions. [2023-11-29 05:32:54,376 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 387 transitions. Word has length 178 [2023-11-29 05:32:54,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:54,376 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 387 transitions. [2023-11-29 05:32:54,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-11-29 05:32:54,377 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 387 transitions. [2023-11-29 05:32:54,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2023-11-29 05:32:54,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:54,379 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:54,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:32:54,380 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:54,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:54,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1759580199, now seen corresponding path program 1 times [2023-11-29 05:32:54,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:54,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284358228] [2023-11-29 05:32:54,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:54,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:54,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:54,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:54,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:54,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:54,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2023-11-29 05:32:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,526 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-11-29 05:32:54,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284358228] [2023-11-29 05:32:54,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284358228] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:32:54,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945368713] [2023-11-29 05:32:54,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:54,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:32:54,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:32:54,529 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:32:54,533 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 05:32:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:54,675 INFO L262 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:32:54,682 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:32:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-11-29 05:32:54,725 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:32:54,856 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2023-11-29 05:32:54,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945368713] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:32:54,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:32:54,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2023-11-29 05:32:54,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403748146] [2023-11-29 05:32:54,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:54,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:54,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:54,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:54,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:54,859 INFO L87 Difference]: Start difference. First operand 286 states and 387 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:32:54,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:54,912 INFO L93 Difference]: Finished difference Result 453 states and 636 transitions. [2023-11-29 05:32:54,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:32:54,912 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 185 [2023-11-29 05:32:54,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:54,915 INFO L225 Difference]: With dead ends: 453 [2023-11-29 05:32:54,915 INFO L226 Difference]: Without dead ends: 265 [2023-11-29 05:32:54,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 396 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:54,916 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 20 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:54,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 711 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:54,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2023-11-29 05:32:54,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2023-11-29 05:32:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 210 states have (on average 1.2857142857142858) internal successors, (270), 214 states have internal predecessors, (270), 43 states have call successors, (43), 11 states have call predecessors, (43), 11 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-29 05:32:54,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 356 transitions. [2023-11-29 05:32:54,932 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 356 transitions. Word has length 185 [2023-11-29 05:32:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:54,933 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 356 transitions. [2023-11-29 05:32:54,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2023-11-29 05:32:54,933 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 356 transitions. [2023-11-29 05:32:54,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2023-11-29 05:32:54,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:54,936 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:54,942 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 05:32:55,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-29 05:32:55,137 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:55,137 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash 238343948, now seen corresponding path program 1 times [2023-11-29 05:32:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796009139] [2023-11-29 05:32:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:55,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:55,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:55,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:55,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:55,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:55,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:55,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:55,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:55,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:32:55,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:55,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:32:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:32:55,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,267 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-11-29 05:32:55,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:55,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796009139] [2023-11-29 05:32:55,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796009139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:55,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:55,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:55,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224000060] [2023-11-29 05:32:55,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:55,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:55,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:55,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:55,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:55,269 INFO L87 Difference]: Start difference. First operand 265 states and 356 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 05:32:55,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:55,307 INFO L93 Difference]: Finished difference Result 410 states and 577 transitions. [2023-11-29 05:32:55,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:55,308 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 209 [2023-11-29 05:32:55,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:55,311 INFO L225 Difference]: With dead ends: 410 [2023-11-29 05:32:55,311 INFO L226 Difference]: Without dead ends: 271 [2023-11-29 05:32:55,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:55,312 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 6 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 752 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:55,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 752 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:55,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-11-29 05:32:55,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2023-11-29 05:32:55,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 213 states have (on average 1.2816901408450705) internal successors, (273), 217 states have internal predecessors, (273), 43 states have call successors, (43), 12 states have call predecessors, (43), 12 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-29 05:32:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 359 transitions. [2023-11-29 05:32:55,324 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 359 transitions. Word has length 209 [2023-11-29 05:32:55,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:55,325 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 359 transitions. [2023-11-29 05:32:55,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2023-11-29 05:32:55,325 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 359 transitions. [2023-11-29 05:32:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2023-11-29 05:32:55,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:55,328 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:32:55,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:32:55,328 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:55,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:55,328 INFO L85 PathProgramCache]: Analyzing trace with hash -2053627783, now seen corresponding path program 1 times [2023-11-29 05:32:55,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:55,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630099843] [2023-11-29 05:32:55,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:55,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:55,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:55,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:55,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:55,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:55,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:55,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:32:55,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:55,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:32:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:32:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:32:55,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,557 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-11-29 05:32:55,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:55,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630099843] [2023-11-29 05:32:55,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630099843] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:32:55,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821583811] [2023-11-29 05:32:55,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:55,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:32:55,558 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:32:55,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:32:55,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 05:32:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:55,728 INFO L262 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:32:55,735 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:32:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2023-11-29 05:32:55,754 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:32:55,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821583811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:55,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:32:55,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-11-29 05:32:55,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889325891] [2023-11-29 05:32:55,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:55,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:55,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:55,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:55,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:55,757 INFO L87 Difference]: Start difference. First operand 269 states and 359 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 05:32:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:55,800 INFO L93 Difference]: Finished difference Result 419 states and 584 transitions. [2023-11-29 05:32:55,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:55,800 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 216 [2023-11-29 05:32:55,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:55,803 INFO L225 Difference]: With dead ends: 419 [2023-11-29 05:32:55,803 INFO L226 Difference]: Without dead ends: 276 [2023-11-29 05:32:55,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:32:55,805 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 7 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:55,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 757 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:55,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-29 05:32:55,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 274. [2023-11-29 05:32:55,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 274 states, 217 states have (on average 1.2764976958525345) internal successors, (277), 221 states have internal predecessors, (277), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-29 05:32:55,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 363 transitions. [2023-11-29 05:32:55,821 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 363 transitions. Word has length 216 [2023-11-29 05:32:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:55,822 INFO L495 AbstractCegarLoop]: Abstraction has 274 states and 363 transitions. [2023-11-29 05:32:55,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2023-11-29 05:32:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 363 transitions. [2023-11-29 05:32:55,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2023-11-29 05:32:55,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:55,825 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:32:55,831 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 05:32:56,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:32:56,026 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:56,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:56,026 INFO L85 PathProgramCache]: Analyzing trace with hash 930837717, now seen corresponding path program 1 times [2023-11-29 05:32:56,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:56,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332411981] [2023-11-29 05:32:56,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:56,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:56,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:56,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:56,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:56,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:56,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:32:56,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:56,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:32:56,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:32:56,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:32:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:32:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,220 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-11-29 05:32:56,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:56,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332411981] [2023-11-29 05:32:56,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332411981] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:32:56,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [737634902] [2023-11-29 05:32:56,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:56,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:32:56,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:32:56,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:32:56,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 05:32:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,392 INFO L262 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:32:56,398 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:32:56,417 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2023-11-29 05:32:56,417 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:32:56,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [737634902] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:56,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:32:56,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-11-29 05:32:56,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575842957] [2023-11-29 05:32:56,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:56,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:56,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:56,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:56,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:56,419 INFO L87 Difference]: Start difference. First operand 274 states and 363 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-29 05:32:56,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:56,463 INFO L93 Difference]: Finished difference Result 421 states and 582 transitions. [2023-11-29 05:32:56,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:32:56,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 224 [2023-11-29 05:32:56,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:56,466 INFO L225 Difference]: With dead ends: 421 [2023-11-29 05:32:56,466 INFO L226 Difference]: Without dead ends: 273 [2023-11-29 05:32:56,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:32:56,467 INFO L413 NwaCegarLoop]: 251 mSDtfsCounter, 7 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 743 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 [2023-11-29 05:32:56,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 743 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:32:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2023-11-29 05:32:56,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2023-11-29 05:32:56,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 217 states have (on average 1.262672811059908) internal successors, (274), 220 states have internal predecessors, (274), 42 states have call successors, (42), 13 states have call predecessors, (42), 13 states have return successors, (42), 42 states have call predecessors, (42), 42 states have call successors, (42) [2023-11-29 05:32:56,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 358 transitions. [2023-11-29 05:32:56,481 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 358 transitions. Word has length 224 [2023-11-29 05:32:56,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:56,482 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 358 transitions. [2023-11-29 05:32:56,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-11-29 05:32:56,482 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 358 transitions. [2023-11-29 05:32:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2023-11-29 05:32:56,485 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:56,486 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:32:56,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 05:32:56,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:32:56,686 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:56,686 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:56,686 INFO L85 PathProgramCache]: Analyzing trace with hash 1128030971, now seen corresponding path program 1 times [2023-11-29 05:32:56,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:56,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278333815] [2023-11-29 05:32:56,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:56,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:56,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:56,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:56,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:56,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:56,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:56,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:56,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:56,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:32:56,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:32:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:32:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:32:56,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:32:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:32:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:56,839 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-11-29 05:32:56,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:56,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278333815] [2023-11-29 05:32:56,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278333815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:56,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:56,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:56,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299657156] [2023-11-29 05:32:56,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:56,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:56,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:56,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:56,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:56,841 INFO L87 Difference]: Start difference. First operand 273 states and 358 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 05:32:57,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:57,145 INFO L93 Difference]: Finished difference Result 419 states and 571 transitions. [2023-11-29 05:32:57,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:32:57,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 231 [2023-11-29 05:32:57,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:57,149 INFO L225 Difference]: With dead ends: 419 [2023-11-29 05:32:57,150 INFO L226 Difference]: Without dead ends: 272 [2023-11-29 05:32:57,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:57,151 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 63 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:57,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 464 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:32:57,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-11-29 05:32:57,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2023-11-29 05:32:57,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 217 states have (on average 1.2580645161290323) internal successors, (273), 219 states have internal predecessors, (273), 41 states have call successors, (41), 13 states have call predecessors, (41), 13 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-11-29 05:32:57,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 355 transitions. [2023-11-29 05:32:57,176 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 355 transitions. Word has length 231 [2023-11-29 05:32:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:57,177 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 355 transitions. [2023-11-29 05:32:57,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-11-29 05:32:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 355 transitions. [2023-11-29 05:32:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2023-11-29 05:32:57,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:57,181 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:32:57,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:32:57,181 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:57,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:57,181 INFO L85 PathProgramCache]: Analyzing trace with hash -162714812, now seen corresponding path program 1 times [2023-11-29 05:32:57,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:57,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008368699] [2023-11-29 05:32:57,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:57,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:57,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:57,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:57,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:57,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:32:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:32:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:32:57,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:32:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:32:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:32:57,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:57,458 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-11-29 05:32:57,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:57,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008368699] [2023-11-29 05:32:57,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008368699] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:57,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:57,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:32:57,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300331539] [2023-11-29 05:32:57,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:57,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:32:57,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:57,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:32:57,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:57,460 INFO L87 Difference]: Start difference. First operand 272 states and 355 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:32:58,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:58,056 INFO L93 Difference]: Finished difference Result 630 states and 851 transitions. [2023-11-29 05:32:58,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:32:58,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 234 [2023-11-29 05:32:58,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:58,061 INFO L225 Difference]: With dead ends: 630 [2023-11-29 05:32:58,061 INFO L226 Difference]: Without dead ends: 484 [2023-11-29 05:32:58,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:32:58,063 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 417 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:58,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 613 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:32:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-11-29 05:32:58,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2023-11-29 05:32:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 376 states have (on average 1.3111702127659575) internal successors, (493), 378 states have internal predecessors, (493), 70 states have call successors, (70), 31 states have call predecessors, (70), 31 states have return successors, (70), 69 states have call predecessors, (70), 70 states have call successors, (70) [2023-11-29 05:32:58,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 633 transitions. [2023-11-29 05:32:58,097 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 633 transitions. Word has length 234 [2023-11-29 05:32:58,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:58,097 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 633 transitions. [2023-11-29 05:32:58,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-29 05:32:58,098 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 633 transitions. [2023-11-29 05:32:58,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2023-11-29 05:32:58,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:58,100 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:58,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 05:32:58,100 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:58,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:58,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2125325853, now seen corresponding path program 1 times [2023-11-29 05:32:58,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:58,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691852969] [2023-11-29 05:32:58,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:58,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:58,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:58,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:58,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:32:58,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:32:58,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:32:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:32:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:32:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:32:58,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2023-11-29 05:32:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-29 05:32:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-29 05:32:58,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-29 05:32:58,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,301 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-11-29 05:32:58,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:58,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691852969] [2023-11-29 05:32:58,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691852969] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:58,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:58,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:58,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187049779] [2023-11-29 05:32:58,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:58,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:58,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:58,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:58,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:58,304 INFO L87 Difference]: Start difference. First operand 478 states and 633 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-29 05:32:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:58,799 INFO L93 Difference]: Finished difference Result 1045 states and 1435 transitions. [2023-11-29 05:32:58,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:58,799 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 264 [2023-11-29 05:32:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:58,804 INFO L225 Difference]: With dead ends: 1045 [2023-11-29 05:32:58,804 INFO L226 Difference]: Without dead ends: 765 [2023-11-29 05:32:58,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:58,805 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 224 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:58,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 461 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:32:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2023-11-29 05:32:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 596. [2023-11-29 05:32:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 469 states have (on average 1.3198294243070363) internal successors, (619), 475 states have internal predecessors, (619), 85 states have call successors, (85), 41 states have call predecessors, (85), 41 states have return successors, (85), 81 states have call predecessors, (85), 85 states have call successors, (85) [2023-11-29 05:32:58,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 789 transitions. [2023-11-29 05:32:58,848 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 789 transitions. Word has length 264 [2023-11-29 05:32:58,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:58,848 INFO L495 AbstractCegarLoop]: Abstraction has 596 states and 789 transitions. [2023-11-29 05:32:58,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 3 states have internal predecessors, (79), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-29 05:32:58,849 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 789 transitions. [2023-11-29 05:32:58,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2023-11-29 05:32:58,850 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:58,851 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:58,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 05:32:58,851 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:58,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash 965816563, now seen corresponding path program 1 times [2023-11-29 05:32:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:58,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827072945] [2023-11-29 05:32:58,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:58,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:58,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:58,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:58,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:58,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:58,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:58,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:32:58,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:58,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:32:58,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:32:58,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:32:58,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:32:58,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:32:58,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2023-11-29 05:32:58,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 235 [2023-11-29 05:32:58,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-29 05:32:58,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 05:32:58,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:58,993 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-11-29 05:32:58,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:58,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827072945] [2023-11-29 05:32:58,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827072945] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:58,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:58,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:58,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521517024] [2023-11-29 05:32:58,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:58,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:58,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:58,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:58,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:58,995 INFO L87 Difference]: Start difference. First operand 596 states and 789 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-29 05:32:59,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:32:59,488 INFO L93 Difference]: Finished difference Result 1316 states and 1793 transitions. [2023-11-29 05:32:59,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:32:59,488 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 265 [2023-11-29 05:32:59,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:32:59,493 INFO L225 Difference]: With dead ends: 1316 [2023-11-29 05:32:59,493 INFO L226 Difference]: Without dead ends: 951 [2023-11-29 05:32:59,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:32:59,495 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 225 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:32:59,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 489 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:32:59,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2023-11-29 05:32:59,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 943. [2023-11-29 05:32:59,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 736 states have (on average 1.3478260869565217) internal successors, (992), 750 states have internal predecessors, (992), 139 states have call successors, (139), 67 states have call predecessors, (139), 67 states have return successors, (139), 129 states have call predecessors, (139), 139 states have call successors, (139) [2023-11-29 05:32:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1270 transitions. [2023-11-29 05:32:59,565 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1270 transitions. Word has length 265 [2023-11-29 05:32:59,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:32:59,566 INFO L495 AbstractCegarLoop]: Abstraction has 943 states and 1270 transitions. [2023-11-29 05:32:59,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2023-11-29 05:32:59,566 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1270 transitions. [2023-11-29 05:32:59,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-11-29 05:32:59,568 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:32:59,568 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:32:59,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 05:32:59,569 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:32:59,569 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:32:59,569 INFO L85 PathProgramCache]: Analyzing trace with hash 542333624, now seen corresponding path program 1 times [2023-11-29 05:32:59,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:32:59,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001234662] [2023-11-29 05:32:59,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:32:59,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:32:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:32:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:32:59,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:32:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:32:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:32:59,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:32:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:32:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:32:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:32:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:32:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:32:59,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:32:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:32:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:32:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:32:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:32:59,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:32:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:32:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:32:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 05:32:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:32:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-29 05:32:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 05:32:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:32:59,702 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-11-29 05:32:59,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:32:59,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001234662] [2023-11-29 05:32:59,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001234662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:32:59,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:32:59,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:32:59,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185806583] [2023-11-29 05:32:59,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:32:59,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:32:59,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:32:59,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:32:59,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:32:59,704 INFO L87 Difference]: Start difference. First operand 943 states and 1270 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:33:00,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:00,267 INFO L93 Difference]: Finished difference Result 2195 states and 3032 transitions. [2023-11-29 05:33:00,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:33:00,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 266 [2023-11-29 05:33:00,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:00,278 INFO L225 Difference]: With dead ends: 2195 [2023-11-29 05:33:00,278 INFO L226 Difference]: Without dead ends: 1523 [2023-11-29 05:33:00,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:33:00,281 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 225 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:00,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 516 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:33:00,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2023-11-29 05:33:00,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1509. [2023-11-29 05:33:00,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1170 states have (on average 1.3743589743589744) internal successors, (1608), 1198 states have internal predecessors, (1608), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2023-11-29 05:33:00,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2070 transitions. [2023-11-29 05:33:00,430 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2070 transitions. Word has length 266 [2023-11-29 05:33:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:00,430 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2070 transitions. [2023-11-29 05:33:00,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:33:00,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2070 transitions. [2023-11-29 05:33:00,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-11-29 05:33:00,433 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:00,434 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:33:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 05:33:00,434 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:00,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash 147966838, now seen corresponding path program 1 times [2023-11-29 05:33:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:00,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950119992] [2023-11-29 05:33:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:00,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:00,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:00,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:00,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:00,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:33:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 05:33:00,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-29 05:33:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 05:33:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2023-11-29 05:33:00,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:00,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950119992] [2023-11-29 05:33:00,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950119992] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:00,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537699167] [2023-11-29 05:33:00,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:00,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:00,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:00,718 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:33:00,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 05:33:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:00,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 868 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:33:00,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2023-11-29 05:33:00,957 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:33:00,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537699167] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:00,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:33:00,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-29 05:33:00,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221701171] [2023-11-29 05:33:00,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:00,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:33:00,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:00,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:33:00,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:33:00,960 INFO L87 Difference]: Start difference. First operand 1509 states and 2070 transitions. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:33:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:01,166 INFO L93 Difference]: Finished difference Result 2787 states and 3881 transitions. [2023-11-29 05:33:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:33:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 266 [2023-11-29 05:33:01,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:01,178 INFO L225 Difference]: With dead ends: 2787 [2023-11-29 05:33:01,178 INFO L226 Difference]: Without dead ends: 1509 [2023-11-29 05:33:01,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:33:01,183 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 51 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:01,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 660 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:33:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2023-11-29 05:33:01,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1509. [2023-11-29 05:33:01,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1170 states have (on average 1.353846153846154) internal successors, (1584), 1198 states have internal predecessors, (1584), 231 states have call successors, (231), 107 states have call predecessors, (231), 107 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2023-11-29 05:33:01,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2046 transitions. [2023-11-29 05:33:01,340 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2046 transitions. Word has length 266 [2023-11-29 05:33:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:01,340 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2046 transitions. [2023-11-29 05:33:01,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:33:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2046 transitions. [2023-11-29 05:33:01,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2023-11-29 05:33:01,343 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:01,344 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:01,351 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 05:33:01,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 05:33:01,545 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:01,545 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:01,545 INFO L85 PathProgramCache]: Analyzing trace with hash -338351429, now seen corresponding path program 1 times [2023-11-29 05:33:01,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021515801] [2023-11-29 05:33:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:01,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:01,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:01,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:01,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:01,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:01,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:01,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:01,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:33:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 05:33:01,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-29 05:33:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-11-29 05:33:01,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:01,840 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 621 trivial. 0 not checked. [2023-11-29 05:33:01,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:01,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021515801] [2023-11-29 05:33:01,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021515801] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:01,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1917300435] [2023-11-29 05:33:01,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:01,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:01,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:01,843 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:33:01,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 05:33:02,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,023 INFO L262 TraceCheckSpWp]: Trace formula consists of 869 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:33:02,028 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:02,061 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2023-11-29 05:33:02,061 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:33:02,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1917300435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:02,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:33:02,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2023-11-29 05:33:02,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566162243] [2023-11-29 05:33:02,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:02,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:33:02,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:02,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:33:02,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:33:02,064 INFO L87 Difference]: Start difference. First operand 1509 states and 2046 transitions. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:33:02,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:02,258 INFO L93 Difference]: Finished difference Result 2787 states and 3825 transitions. [2023-11-29 05:33:02,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:33:02,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 267 [2023-11-29 05:33:02,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:02,270 INFO L225 Difference]: With dead ends: 2787 [2023-11-29 05:33:02,270 INFO L226 Difference]: Without dead ends: 1557 [2023-11-29 05:33:02,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 314 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:33:02,274 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 15 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:02,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 683 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:33:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2023-11-29 05:33:02,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1557. [2023-11-29 05:33:02,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1210 states have (on average 1.3553719008264462) internal successors, (1640), 1238 states have internal predecessors, (1640), 231 states have call successors, (231), 115 states have call predecessors, (231), 115 states have return successors, (231), 211 states have call predecessors, (231), 231 states have call successors, (231) [2023-11-29 05:33:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 2102 transitions. [2023-11-29 05:33:02,426 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 2102 transitions. Word has length 267 [2023-11-29 05:33:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:02,426 INFO L495 AbstractCegarLoop]: Abstraction has 1557 states and 2102 transitions. [2023-11-29 05:33:02,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 05:33:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 2102 transitions. [2023-11-29 05:33:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2023-11-29 05:33:02,429 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:02,430 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:02,439 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 05:33:02,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 05:33:02,639 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:02,639 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:02,639 INFO L85 PathProgramCache]: Analyzing trace with hash -8905584, now seen corresponding path program 1 times [2023-11-29 05:33:02,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:02,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851399575] [2023-11-29 05:33:02,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:02,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:02,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:02,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:02,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:02,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:02,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:02,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:02,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:02,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:02,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:02,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:02,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:02,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:02,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:03,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:03,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:03,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:03,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:03,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:33:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:03,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 05:33:03,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:03,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:03,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:03,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-29 05:33:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:03,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 05:33:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:03,018 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2023-11-29 05:33:03,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:03,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851399575] [2023-11-29 05:33:03,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851399575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:03,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:03,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:33:03,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244602006] [2023-11-29 05:33:03,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:03,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:33:03,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:03,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:33:03,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:33:03,021 INFO L87 Difference]: Start difference. First operand 1557 states and 2102 transitions. Second operand has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:33:03,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:03,824 INFO L93 Difference]: Finished difference Result 2371 states and 3433 transitions. [2023-11-29 05:33:03,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:33:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 268 [2023-11-29 05:33:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:03,842 INFO L225 Difference]: With dead ends: 2371 [2023-11-29 05:33:03,842 INFO L226 Difference]: Without dead ends: 2369 [2023-11-29 05:33:03,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:33:03,844 INFO L413 NwaCegarLoop]: 312 mSDtfsCounter, 232 mSDsluCounter, 1150 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 1462 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:03,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 1462 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 05:33:03,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2369 states. [2023-11-29 05:33:04,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2369 to 1605. [2023-11-29 05:33:04,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1605 states, 1242 states have (on average 1.3462157809983897) internal successors, (1672), 1278 states have internal predecessors, (1672), 239 states have call successors, (239), 123 states have call predecessors, (239), 123 states have return successors, (239), 211 states have call predecessors, (239), 239 states have call successors, (239) [2023-11-29 05:33:04,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2150 transitions. [2023-11-29 05:33:04,047 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2150 transitions. Word has length 268 [2023-11-29 05:33:04,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:04,047 INFO L495 AbstractCegarLoop]: Abstraction has 1605 states and 2150 transitions. [2023-11-29 05:33:04,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.166666666666666) internal successors, (85), 5 states have internal predecessors, (85), 2 states have call successors, (17), 3 states have call predecessors, (17), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-29 05:33:04,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2150 transitions. [2023-11-29 05:33:04,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2023-11-29 05:33:04,051 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:04,051 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:04,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 05:33:04,051 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:04,052 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:04,052 INFO L85 PathProgramCache]: Analyzing trace with hash -767029101, now seen corresponding path program 1 times [2023-11-29 05:33:04,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:04,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864656365] [2023-11-29 05:33:04,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:04,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:04,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:04,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:33:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 05:33:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-29 05:33:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 05:33:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-11-29 05:33:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2023-11-29 05:33:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:04,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864656365] [2023-11-29 05:33:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864656365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [316180542] [2023-11-29 05:33:04,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:04,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:04,424 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:33:04,429 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 05:33:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:04,623 INFO L262 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 05:33:04,628 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 251 proven. 37 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2023-11-29 05:33:04,829 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:33:05,182 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2023-11-29 05:33:05,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [316180542] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:33:05,183 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:33:05,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2023-11-29 05:33:05,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217178763] [2023-11-29 05:33:05,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:33:05,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 05:33:05,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:05,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 05:33:05,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:33:05,186 INFO L87 Difference]: Start difference. First operand 1605 states and 2150 transitions. Second operand has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2023-11-29 05:33:07,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:07,080 INFO L93 Difference]: Finished difference Result 4131 states and 5853 transitions. [2023-11-29 05:33:07,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:33:07,081 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) Word has length 276 [2023-11-29 05:33:07,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:07,101 INFO L225 Difference]: With dead ends: 4131 [2023-11-29 05:33:07,101 INFO L226 Difference]: Without dead ends: 2805 [2023-11-29 05:33:07,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 637 GetRequests, 598 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 05:33:07,107 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 390 mSDsluCounter, 2033 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 439 SdHoareTripleChecker+Valid, 2264 SdHoareTripleChecker+Invalid, 1884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:07,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [439 Valid, 2264 Invalid, 1884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 05:33:07,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2023-11-29 05:33:07,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2383. [2023-11-29 05:33:07,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 1837 states have (on average 1.3331518780620577) internal successors, (2449), 1889 states have internal predecessors, (2449), 356 states have call successors, (356), 183 states have call predecessors, (356), 189 states have return successors, (364), 318 states have call predecessors, (364), 356 states have call successors, (364) [2023-11-29 05:33:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 3169 transitions. [2023-11-29 05:33:07,338 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 3169 transitions. Word has length 276 [2023-11-29 05:33:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:07,339 INFO L495 AbstractCegarLoop]: Abstraction has 2383 states and 3169 transitions. [2023-11-29 05:33:07,339 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.842105263157895) internal successors, (149), 14 states have internal predecessors, (149), 5 states have call successors, (32), 5 states have call predecessors, (32), 9 states have return successors, (31), 8 states have call predecessors, (31), 5 states have call successors, (31) [2023-11-29 05:33:07,339 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 3169 transitions. [2023-11-29 05:33:07,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2023-11-29 05:33:07,342 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:07,342 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:07,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 05:33:07,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 05:33:07,543 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:07,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:07,543 INFO L85 PathProgramCache]: Analyzing trace with hash 194584916, now seen corresponding path program 1 times [2023-11-29 05:33:07,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:07,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592705205] [2023-11-29 05:33:07,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:07,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:07,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:07,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:07,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:07,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:07,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:07,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:07,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:07,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:33:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 05:33:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-29 05:33:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 05:33:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-11-29 05:33:07,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 672 trivial. 0 not checked. [2023-11-29 05:33:07,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592705205] [2023-11-29 05:33:07,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592705205] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:07,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210588820] [2023-11-29 05:33:07,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:07,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:07,671 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:07,672 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:33:07,701 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 05:33:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:07,906 INFO L262 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:33:07,912 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:07,937 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 611 trivial. 0 not checked. [2023-11-29 05:33:07,937 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:33:07,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210588820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:07,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:33:07,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-11-29 05:33:07,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135001186] [2023-11-29 05:33:07,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:07,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:33:07,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:07,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:33:07,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:33:07,940 INFO L87 Difference]: Start difference. First operand 2383 states and 3169 transitions. Second operand has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:33:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:08,150 INFO L93 Difference]: Finished difference Result 4600 states and 6215 transitions. [2023-11-29 05:33:08,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:33:08,150 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 276 [2023-11-29 05:33:08,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:08,165 INFO L225 Difference]: With dead ends: 4600 [2023-11-29 05:33:08,165 INFO L226 Difference]: Without dead ends: 2319 [2023-11-29 05:33:08,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:33:08,171 INFO L413 NwaCegarLoop]: 235 mSDtfsCounter, 11 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:08,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 683 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:33:08,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2319 states. [2023-11-29 05:33:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2319 to 2319. [2023-11-29 05:33:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2319 states, 1793 states have (on average 1.3156720580033463) internal successors, (2359), 1845 states have internal predecessors, (2359), 340 states have call successors, (340), 183 states have call predecessors, (340), 185 states have return successors, (344), 298 states have call predecessors, (344), 340 states have call successors, (344) [2023-11-29 05:33:08,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2319 states to 2319 states and 3043 transitions. [2023-11-29 05:33:08,433 INFO L78 Accepts]: Start accepts. Automaton has 2319 states and 3043 transitions. Word has length 276 [2023-11-29 05:33:08,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:08,434 INFO L495 AbstractCegarLoop]: Abstraction has 2319 states and 3043 transitions. [2023-11-29 05:33:08,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.5) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 05:33:08,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2319 states and 3043 transitions. [2023-11-29 05:33:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2023-11-29 05:33:08,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:08,439 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:08,445 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 05:33:08,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:08,645 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:08,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:08,646 INFO L85 PathProgramCache]: Analyzing trace with hash -2011160599, now seen corresponding path program 1 times [2023-11-29 05:33:08,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:08,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355180422] [2023-11-29 05:33:08,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:08,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:08,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:08,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:08,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 05:33:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-11-29 05:33:08,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 05:33:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-29 05:33:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2023-11-29 05:33:08,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2023-11-29 05:33:08,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-29 05:33:08,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-29 05:33:08,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2023-11-29 05:33:08,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2023-11-29 05:33:08,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2023-11-29 05:33:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:08,818 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2023-11-29 05:33:08,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:08,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355180422] [2023-11-29 05:33:08,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355180422] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:08,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748180760] [2023-11-29 05:33:08,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:08,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:08,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:08,819 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:33:08,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 05:33:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:09,003 INFO L262 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:33:09,008 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:09,024 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2023-11-29 05:33:09,024 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:33:09,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748180760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:09,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:33:09,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-11-29 05:33:09,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333119775] [2023-11-29 05:33:09,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:09,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:33:09,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:09,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:33:09,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:33:09,027 INFO L87 Difference]: Start difference. First operand 2319 states and 3043 transitions. Second operand has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:33:09,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:09,183 INFO L93 Difference]: Finished difference Result 4382 states and 5856 transitions. [2023-11-29 05:33:09,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:33:09,183 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 279 [2023-11-29 05:33:09,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:09,193 INFO L225 Difference]: With dead ends: 4382 [2023-11-29 05:33:09,193 INFO L226 Difference]: Without dead ends: 2147 [2023-11-29 05:33:09,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:33:09,208 INFO L413 NwaCegarLoop]: 238 mSDtfsCounter, 8 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:09,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 686 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:33:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2147 states. [2023-11-29 05:33:09,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2147 to 2147. [2023-11-29 05:33:09,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2147 states, 1651 states have (on average 1.3095093882495457) internal successors, (2162), 1703 states have internal predecessors, (2162), 323 states have call successors, (323), 172 states have call predecessors, (323), 172 states have return successors, (323), 279 states have call predecessors, (323), 323 states have call successors, (323) [2023-11-29 05:33:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2147 states to 2147 states and 2808 transitions. [2023-11-29 05:33:09,417 INFO L78 Accepts]: Start accepts. Automaton has 2147 states and 2808 transitions. Word has length 279 [2023-11-29 05:33:09,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:09,418 INFO L495 AbstractCegarLoop]: Abstraction has 2147 states and 2808 transitions. [2023-11-29 05:33:09,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.0) internal successors, (104), 4 states have internal predecessors, (104), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:33:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 2147 states and 2808 transitions. [2023-11-29 05:33:09,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2023-11-29 05:33:09,423 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:09,423 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:09,430 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 05:33:09,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2023-11-29 05:33:09,629 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:09,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:09,629 INFO L85 PathProgramCache]: Analyzing trace with hash 435768030, now seen corresponding path program 1 times [2023-11-29 05:33:09,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:09,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572498737] [2023-11-29 05:33:09,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:09,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:10,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:10,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:10,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:10,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:10,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:10,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:10,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:10,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:10,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:10,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:10,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:10,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:33:10,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 05:33:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-29 05:33:10,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 05:33:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-11-29 05:33:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-11-29 05:33:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2023-11-29 05:33:10,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,405 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2023-11-29 05:33:10,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:10,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572498737] [2023-11-29 05:33:10,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572498737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:10,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657301806] [2023-11-29 05:33:10,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:10,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:10,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:10,407 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:33:10,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 05:33:10,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:10,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:33:10,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:10,744 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 152 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2023-11-29 05:33:10,744 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:33:10,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657301806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:10,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:33:10,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2023-11-29 05:33:10,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686032591] [2023-11-29 05:33:10,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:10,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:33:10,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:10,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:33:10,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:33:10,747 INFO L87 Difference]: Start difference. First operand 2147 states and 2808 transitions. Second operand has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 05:33:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:11,245 INFO L93 Difference]: Finished difference Result 4793 states and 6263 transitions. [2023-11-29 05:33:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:33:11,245 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) Word has length 291 [2023-11-29 05:33:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:11,267 INFO L225 Difference]: With dead ends: 4793 [2023-11-29 05:33:11,268 INFO L226 Difference]: Without dead ends: 3203 [2023-11-29 05:33:11,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 338 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=540, Unknown=0, NotChecked=0, Total=600 [2023-11-29 05:33:11,274 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 134 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1735 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:11,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1735 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:33:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3203 states. [2023-11-29 05:33:11,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3203 to 3149. [2023-11-29 05:33:11,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3149 states, 2414 states have (on average 1.3024026512013256) internal successors, (3144), 2494 states have internal predecessors, (3144), 467 states have call successors, (467), 267 states have call predecessors, (467), 267 states have return successors, (467), 395 states have call predecessors, (467), 467 states have call successors, (467) [2023-11-29 05:33:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3149 states to 3149 states and 4078 transitions. [2023-11-29 05:33:11,615 INFO L78 Accepts]: Start accepts. Automaton has 3149 states and 4078 transitions. Word has length 291 [2023-11-29 05:33:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:11,616 INFO L495 AbstractCegarLoop]: Abstraction has 3149 states and 4078 transitions. [2023-11-29 05:33:11,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.25) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (20), 3 states have call predecessors, (20), 4 states have return successors, (19), 4 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 05:33:11,616 INFO L276 IsEmpty]: Start isEmpty. Operand 3149 states and 4078 transitions. [2023-11-29 05:33:11,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2023-11-29 05:33:11,620 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:11,620 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:11,626 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-29 05:33:11,820 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2023-11-29 05:33:11,821 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:11,821 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:11,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1216360965, now seen corresponding path program 1 times [2023-11-29 05:33:11,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:11,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070142017] [2023-11-29 05:33:11,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:11,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:11,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:11,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:11,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:11,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:11,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:11,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:11,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:11,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:11,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:12,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:12,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:12,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:12,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:12,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:12,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:33:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 05:33:12,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:12,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-29 05:33:12,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-29 05:33:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-11-29 05:33:12,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-11-29 05:33:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-11-29 05:33:12,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:12,080 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2023-11-29 05:33:12,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:12,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070142017] [2023-11-29 05:33:12,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070142017] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:12,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:12,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 05:33:12,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704221206] [2023-11-29 05:33:12,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:12,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:33:12,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:12,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:33:12,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:33:12,083 INFO L87 Difference]: Start difference. First operand 3149 states and 4078 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 05:33:12,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:12,836 INFO L93 Difference]: Finished difference Result 7201 states and 9776 transitions. [2023-11-29 05:33:12,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:33:12,837 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 297 [2023-11-29 05:33:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:12,863 INFO L225 Difference]: With dead ends: 7201 [2023-11-29 05:33:12,863 INFO L226 Difference]: Without dead ends: 4549 [2023-11-29 05:33:12,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:33:12,872 INFO L413 NwaCegarLoop]: 264 mSDtfsCounter, 185 mSDsluCounter, 955 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 1219 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:12,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 1219 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 05:33:12,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4549 states. [2023-11-29 05:33:13,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4549 to 3405. [2023-11-29 05:33:13,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3405 states, 2622 states have (on average 1.315026697177727) internal successors, (3448), 2702 states have internal predecessors, (3448), 515 states have call successors, (515), 267 states have call predecessors, (515), 267 states have return successors, (515), 443 states have call predecessors, (515), 515 states have call successors, (515) [2023-11-29 05:33:13,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3405 states to 3405 states and 4478 transitions. [2023-11-29 05:33:13,273 INFO L78 Accepts]: Start accepts. Automaton has 3405 states and 4478 transitions. Word has length 297 [2023-11-29 05:33:13,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:13,273 INFO L495 AbstractCegarLoop]: Abstraction has 3405 states and 4478 transitions. [2023-11-29 05:33:13,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 6 states have internal predecessors, (94), 5 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2023-11-29 05:33:13,274 INFO L276 IsEmpty]: Start isEmpty. Operand 3405 states and 4478 transitions. [2023-11-29 05:33:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2023-11-29 05:33:13,276 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:13,277 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:13,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 05:33:13,277 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:13,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:13,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1248191351, now seen corresponding path program 1 times [2023-11-29 05:33:13,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:13,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48284674] [2023-11-29 05:33:13,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:13,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:13,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:13,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:13,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:13,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:13,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:13,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:13,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:13,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:13,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:13,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:13,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:13,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:33:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2023-11-29 05:33:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2023-11-29 05:33:13,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-29 05:33:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2023-11-29 05:33:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-11-29 05:33:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-11-29 05:33:13,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:13,533 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 771 trivial. 0 not checked. [2023-11-29 05:33:13,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:13,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48284674] [2023-11-29 05:33:13,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48284674] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:13,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:13,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:33:13,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364138212] [2023-11-29 05:33:13,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:13,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:33:13,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:13,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:33:13,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:33:13,535 INFO L87 Difference]: Start difference. First operand 3405 states and 4478 transitions. Second operand has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 05:33:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:14,122 INFO L93 Difference]: Finished difference Result 6158 states and 8150 transitions. [2023-11-29 05:33:14,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:33:14,130 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 297 [2023-11-29 05:33:14,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:14,148 INFO L225 Difference]: With dead ends: 6158 [2023-11-29 05:33:14,148 INFO L226 Difference]: Without dead ends: 3355 [2023-11-29 05:33:14,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:33:14,156 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 63 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:14,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 764 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:33:14,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3355 states. [2023-11-29 05:33:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3355 to 3355. [2023-11-29 05:33:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3355 states, 2581 states have (on average 1.3115071677644323) internal successors, (3385), 2656 states have internal predecessors, (3385), 511 states have call successors, (511), 263 states have call predecessors, (511), 262 states have return successors, (510), 442 states have call predecessors, (510), 510 states have call successors, (510) [2023-11-29 05:33:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3355 states to 3355 states and 4406 transitions. [2023-11-29 05:33:14,493 INFO L78 Accepts]: Start accepts. Automaton has 3355 states and 4406 transitions. Word has length 297 [2023-11-29 05:33:14,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:14,494 INFO L495 AbstractCegarLoop]: Abstraction has 3355 states and 4406 transitions. [2023-11-29 05:33:14,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (20), 3 states have call predecessors, (20), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2023-11-29 05:33:14,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3355 states and 4406 transitions. [2023-11-29 05:33:14,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2023-11-29 05:33:14,497 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:14,497 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:14,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 05:33:14,498 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:14,498 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:14,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1894221007, now seen corresponding path program 1 times [2023-11-29 05:33:14,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:14,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405692270] [2023-11-29 05:33:14,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:14,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:14,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:14,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:14,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:14,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:14,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-11-29 05:33:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 05:33:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 05:33:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-29 05:33:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-29 05:33:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 05:33:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-11-29 05:33:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-11-29 05:33:14,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2023-11-29 05:33:14,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405692270] [2023-11-29 05:33:14,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405692270] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:14,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004722176] [2023-11-29 05:33:14,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:14,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:14,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:14,964 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:33:14,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 05:33:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:15,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 05:33:15,171 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:15,380 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 189 proven. 4 refuted. 0 times theorem prover too weak. 589 trivial. 0 not checked. [2023-11-29 05:33:15,380 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:33:15,525 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2023-11-29 05:33:15,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004722176] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:15,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-29 05:33:15,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 10] total 21 [2023-11-29 05:33:15,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109243297] [2023-11-29 05:33:15,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:15,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:33:15,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:15,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:33:15,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2023-11-29 05:33:15,528 INFO L87 Difference]: Start difference. First operand 3355 states and 4406 transitions. Second operand has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:33:16,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:16,932 INFO L93 Difference]: Finished difference Result 11635 states and 15543 transitions. [2023-11-29 05:33:16,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:33:16,933 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 302 [2023-11-29 05:33:16,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:16,959 INFO L225 Difference]: With dead ends: 11635 [2023-11-29 05:33:16,959 INFO L226 Difference]: Without dead ends: 8792 [2023-11-29 05:33:16,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 687 GetRequests, 651 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=145, Invalid=1187, Unknown=0, NotChecked=0, Total=1332 [2023-11-29 05:33:16,968 INFO L413 NwaCegarLoop]: 431 mSDtfsCounter, 751 mSDsluCounter, 2666 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 3097 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:16,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 3097 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:33:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8792 states. [2023-11-29 05:33:17,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8792 to 5440. [2023-11-29 05:33:17,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5440 states, 4164 states have (on average 1.3064361191162344) internal successors, (5440), 4284 states have internal predecessors, (5440), 852 states have call successors, (852), 424 states have call predecessors, (852), 423 states have return successors, (851), 738 states have call predecessors, (851), 851 states have call successors, (851) [2023-11-29 05:33:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5440 states to 5440 states and 7143 transitions. [2023-11-29 05:33:17,520 INFO L78 Accepts]: Start accepts. Automaton has 5440 states and 7143 transitions. Word has length 302 [2023-11-29 05:33:17,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:17,521 INFO L495 AbstractCegarLoop]: Abstraction has 5440 states and 7143 transitions. [2023-11-29 05:33:17,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.6) internal successors, (96), 9 states have internal predecessors, (96), 4 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:33:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 5440 states and 7143 transitions. [2023-11-29 05:33:17,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2023-11-29 05:33:17,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:17,526 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2023-11-29 05:33:17,532 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 05:33:17,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:17,727 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:17,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:17,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1218887887, now seen corresponding path program 1 times [2023-11-29 05:33:17,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:17,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416548324] [2023-11-29 05:33:17,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:17,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:18,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:18,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:18,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:18,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:18,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:18,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-11-29 05:33:18,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 05:33:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 05:33:18,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-29 05:33:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-29 05:33:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 05:33:18,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-11-29 05:33:18,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-11-29 05:33:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,121 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 772 trivial. 0 not checked. [2023-11-29 05:33:18,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416548324] [2023-11-29 05:33:18,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416548324] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:18,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897508622] [2023-11-29 05:33:18,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:18,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:18,122 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:18,124 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:33:18,129 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 05:33:18,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:18,360 INFO L262 TraceCheckSpWp]: Trace formula consists of 969 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 05:33:18,367 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:18,478 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 195 proven. 0 refuted. 0 times theorem prover too weak. 587 trivial. 0 not checked. [2023-11-29 05:33:18,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:33:18,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897508622] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:18,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:33:18,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2023-11-29 05:33:18,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245073486] [2023-11-29 05:33:18,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:18,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 05:33:18,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:18,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 05:33:18,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:33:18,481 INFO L87 Difference]: Start difference. First operand 5440 states and 7143 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:33:19,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:19,328 INFO L93 Difference]: Finished difference Result 11434 states and 15253 transitions. [2023-11-29 05:33:19,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:33:19,328 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) Word has length 302 [2023-11-29 05:33:19,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:19,348 INFO L225 Difference]: With dead ends: 11434 [2023-11-29 05:33:19,348 INFO L226 Difference]: Without dead ends: 6458 [2023-11-29 05:33:19,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 355 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2023-11-29 05:33:19,377 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 186 mSDsluCounter, 1715 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 2094 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:19,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 2094 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 05:33:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6458 states. [2023-11-29 05:33:19,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6458 to 5276. [2023-11-29 05:33:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5276 states, 4040 states have (on average 1.299009900990099) internal successors, (5248), 4156 states have internal predecessors, (5248), 816 states have call successors, (816), 420 states have call predecessors, (816), 419 states have return successors, (815), 706 states have call predecessors, (815), 815 states have call successors, (815) [2023-11-29 05:33:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5276 states to 5276 states and 6879 transitions. [2023-11-29 05:33:19,791 INFO L78 Accepts]: Start accepts. Automaton has 5276 states and 6879 transitions. Word has length 302 [2023-11-29 05:33:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:19,791 INFO L495 AbstractCegarLoop]: Abstraction has 5276 states and 6879 transitions. [2023-11-29 05:33:19,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 7 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 4 states have return successors, (20), 4 states have call predecessors, (20), 3 states have call successors, (20) [2023-11-29 05:33:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 5276 states and 6879 transitions. [2023-11-29 05:33:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2023-11-29 05:33:19,794 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:19,794 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:33:19,800 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 05:33:19,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:19,995 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:19,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 621231855, now seen corresponding path program 1 times [2023-11-29 05:33:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:19,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630427914] [2023-11-29 05:33:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:20,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:20,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:20,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:20,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:20,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-11-29 05:33:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 05:33:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:20,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 05:33:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-29 05:33:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-11-29 05:33:20,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-11-29 05:33:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-11-29 05:33:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-11-29 05:33:20,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2023-11-29 05:33:20,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:20,150 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 716 trivial. 0 not checked. [2023-11-29 05:33:20,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:20,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630427914] [2023-11-29 05:33:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630427914] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:33:20,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:33:20,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:33:20,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350133303] [2023-11-29 05:33:20,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:33:20,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:33:20,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:20,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:33:20,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:33:20,153 INFO L87 Difference]: Start difference. First operand 5276 states and 6879 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:33:21,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:21,164 INFO L93 Difference]: Finished difference Result 8879 states and 11621 transitions. [2023-11-29 05:33:21,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:33:21,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 309 [2023-11-29 05:33:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:21,178 INFO L225 Difference]: With dead ends: 8879 [2023-11-29 05:33:21,178 INFO L226 Difference]: Without dead ends: 4363 [2023-11-29 05:33:21,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:33:21,188 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 472 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 644 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:21,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 746 Invalid, 644 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 05:33:21,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4363 states. [2023-11-29 05:33:21,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4363 to 4337. [2023-11-29 05:33:21,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4337 states, 3326 states have (on average 1.280216476247745) internal successors, (4258), 3420 states have internal predecessors, (4258), 665 states have call successors, (665), 345 states have call predecessors, (665), 345 states have return successors, (665), 571 states have call predecessors, (665), 665 states have call successors, (665) [2023-11-29 05:33:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4337 states to 4337 states and 5588 transitions. [2023-11-29 05:33:21,633 INFO L78 Accepts]: Start accepts. Automaton has 4337 states and 5588 transitions. Word has length 309 [2023-11-29 05:33:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:33:21,634 INFO L495 AbstractCegarLoop]: Abstraction has 4337 states and 5588 transitions. [2023-11-29 05:33:21,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (19), 3 states have call predecessors, (19), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:33:21,634 INFO L276 IsEmpty]: Start isEmpty. Operand 4337 states and 5588 transitions. [2023-11-29 05:33:21,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2023-11-29 05:33:21,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:33:21,643 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:33:21,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 05:33:21,643 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:33:21,643 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:33:21,644 INFO L85 PathProgramCache]: Analyzing trace with hash 778601870, now seen corresponding path program 1 times [2023-11-29 05:33:21,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:33:21,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46451464] [2023-11-29 05:33:21,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:21,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:33:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:33:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:33:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:33:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:33:22,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:33:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:33:22,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:33:22,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:33:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:33:22,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:33:22,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:33:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:33:22,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:33:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:33:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:33:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:33:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:33:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:33:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-11-29 05:33:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 05:33:22,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:33:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 05:33:22,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-29 05:33:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2023-11-29 05:33:22,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2023-11-29 05:33:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2023-11-29 05:33:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2023-11-29 05:33:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2023-11-29 05:33:22,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-11-29 05:33:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2023-11-29 05:33:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-11-29 05:33:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 325 [2023-11-29 05:33:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 334 [2023-11-29 05:33:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2023-11-29 05:33:22,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:22,741 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 16 proven. 25 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2023-11-29 05:33:22,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:33:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46451464] [2023-11-29 05:33:22,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46451464] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:33:22,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983425687] [2023-11-29 05:33:22,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:33:22,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:33:22,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:33:22,743 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:33:22,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 05:33:22,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:33:23,002 INFO L262 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 05:33:23,011 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:33:23,429 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 240 proven. 90 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2023-11-29 05:33:23,429 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:33:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 914 backedges. 34 proven. 70 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2023-11-29 05:33:24,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [983425687] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:33:24,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:33:24,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2023-11-29 05:33:24,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962366113] [2023-11-29 05:33:24,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:33:24,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 05:33:24,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:33:24,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 05:33:24,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 05:33:24,164 INFO L87 Difference]: Start difference. First operand 4337 states and 5588 transitions. Second operand has 34 states, 34 states have (on average 7.029411764705882) internal successors, (239), 29 states have internal predecessors, (239), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) [2023-11-29 05:33:59,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:33:59,395 INFO L93 Difference]: Finished difference Result 43506 states and 57298 transitions. [2023-11-29 05:33:59,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 405 states. [2023-11-29 05:33:59,396 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.029411764705882) internal successors, (239), 29 states have internal predecessors, (239), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) Word has length 356 [2023-11-29 05:33:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:33:59,497 INFO L225 Difference]: With dead ends: 43506 [2023-11-29 05:33:59,497 INFO L226 Difference]: Without dead ends: 39565 [2023-11-29 05:33:59,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1242 GetRequests, 800 SyntacticMatches, 8 SemanticMatches, 434 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80316 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=13143, Invalid=176517, Unknown=0, NotChecked=0, Total=189660 [2023-11-29 05:33:59,543 INFO L413 NwaCegarLoop]: 753 mSDtfsCounter, 6674 mSDsluCounter, 12351 mSDsCounter, 0 mSdLazyCounter, 14177 mSolverCounterSat, 2353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6674 SdHoareTripleChecker+Valid, 13104 SdHoareTripleChecker+Invalid, 16530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2353 IncrementalHoareTripleChecker+Valid, 14177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-11-29 05:33:59,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6674 Valid, 13104 Invalid, 16530 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2353 Valid, 14177 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2023-11-29 05:33:59,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39565 states. [2023-11-29 05:34:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39565 to 9551. [2023-11-29 05:34:01,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9551 states, 7296 states have (on average 1.255345394736842) internal successors, (9159), 7494 states have internal predecessors, (9159), 1473 states have call successors, (1473), 737 states have call predecessors, (1473), 781 states have return successors, (1535), 1319 states have call predecessors, (1535), 1473 states have call successors, (1535) [2023-11-29 05:34:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9551 states to 9551 states and 12167 transitions. [2023-11-29 05:34:01,538 INFO L78 Accepts]: Start accepts. Automaton has 9551 states and 12167 transitions. Word has length 356 [2023-11-29 05:34:01,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:01,538 INFO L495 AbstractCegarLoop]: Abstraction has 9551 states and 12167 transitions. [2023-11-29 05:34:01,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.029411764705882) internal successors, (239), 29 states have internal predecessors, (239), 10 states have call successors, (67), 9 states have call predecessors, (67), 15 states have return successors, (67), 14 states have call predecessors, (67), 10 states have call successors, (67) [2023-11-29 05:34:01,538 INFO L276 IsEmpty]: Start isEmpty. Operand 9551 states and 12167 transitions. [2023-11-29 05:34:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2023-11-29 05:34:01,559 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:01,560 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:34:01,567 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-29 05:34:01,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-29 05:34:01,760 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:34:01,760 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:01,761 INFO L85 PathProgramCache]: Analyzing trace with hash 117490334, now seen corresponding path program 1 times [2023-11-29 05:34:01,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:01,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100623744] [2023-11-29 05:34:01,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:34:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:34:03,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:34:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:34:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:34:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:34:03,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:34:03,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:34:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:34:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:34:03,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:34:03,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:34:03,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:34:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:34:03,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:34:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:34:03,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:34:03,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:34:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:34:03,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 05:34:03,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-29 05:34:03,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-29 05:34:03,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 05:34:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-29 05:34:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 270 [2023-11-29 05:34:03,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2023-11-29 05:34:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-11-29 05:34:03,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2023-11-29 05:34:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-11-29 05:34:03,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2023-11-29 05:34:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-11-29 05:34:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2023-11-29 05:34:03,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-11-29 05:34:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 343 [2023-11-29 05:34:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2023-11-29 05:34:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100623744] [2023-11-29 05:34:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100623744] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:34:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160993918] [2023-11-29 05:34:03,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:03,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:34:03,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:34:03,380 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:34:03,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 05:34:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:03,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 1254 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 05:34:03,598 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:34:03,985 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 206 proven. 117 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2023-11-29 05:34:03,985 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:34:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 33 proven. 68 refuted. 0 times theorem prover too weak. 810 trivial. 0 not checked. [2023-11-29 05:34:04,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160993918] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:34:04,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:34:04,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 13] total 35 [2023-11-29 05:34:04,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985798426] [2023-11-29 05:34:04,560 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:34:04,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 05:34:04,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:04,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 05:34:04,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1099, Unknown=0, NotChecked=0, Total=1190 [2023-11-29 05:34:04,563 INFO L87 Difference]: Start difference. First operand 9551 states and 12167 transitions. Second operand has 35 states, 35 states have (on average 6.857142857142857) internal successors, (240), 30 states have internal predecessors, (240), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 15 states have call predecessors, (68), 11 states have call successors, (68) [2023-11-29 05:34:44,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:44,794 INFO L93 Difference]: Finished difference Result 42052 states and 53627 transitions. [2023-11-29 05:34:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 434 states. [2023-11-29 05:34:44,795 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 6.857142857142857) internal successors, (240), 30 states have internal predecessors, (240), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 15 states have call predecessors, (68), 11 states have call successors, (68) Word has length 357 [2023-11-29 05:34:44,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:44,887 INFO L225 Difference]: With dead ends: 42052 [2023-11-29 05:34:44,887 INFO L226 Difference]: Without dead ends: 33308 [2023-11-29 05:34:44,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1278 GetRequests, 812 SyntacticMatches, 1 SemanticMatches, 465 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93718 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=14495, Invalid=203127, Unknown=0, NotChecked=0, Total=217622 [2023-11-29 05:34:44,911 INFO L413 NwaCegarLoop]: 749 mSDtfsCounter, 6897 mSDsluCounter, 12053 mSDsCounter, 0 mSdLazyCounter, 18800 mSolverCounterSat, 2580 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6897 SdHoareTripleChecker+Valid, 12802 SdHoareTripleChecker+Invalid, 21380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2580 IncrementalHoareTripleChecker+Valid, 18800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:44,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6897 Valid, 12802 Invalid, 21380 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2580 Valid, 18800 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2023-11-29 05:34:44,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33308 states. [2023-11-29 05:34:46,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33308 to 7172. [2023-11-29 05:34:46,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7172 states, 5556 states have (on average 1.2377609791216702) internal successors, (6877), 5691 states have internal predecessors, (6877), 1009 states have call successors, (1009), 567 states have call predecessors, (1009), 606 states have return successors, (1058), 913 states have call predecessors, (1058), 1009 states have call successors, (1058) [2023-11-29 05:34:46,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7172 states to 7172 states and 8944 transitions. [2023-11-29 05:34:46,796 INFO L78 Accepts]: Start accepts. Automaton has 7172 states and 8944 transitions. Word has length 357 [2023-11-29 05:34:46,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:46,797 INFO L495 AbstractCegarLoop]: Abstraction has 7172 states and 8944 transitions. [2023-11-29 05:34:46,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 6.857142857142857) internal successors, (240), 30 states have internal predecessors, (240), 11 states have call successors, (68), 9 states have call predecessors, (68), 14 states have return successors, (68), 15 states have call predecessors, (68), 11 states have call successors, (68) [2023-11-29 05:34:46,797 INFO L276 IsEmpty]: Start isEmpty. Operand 7172 states and 8944 transitions. [2023-11-29 05:34:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2023-11-29 05:34:46,808 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:46,808 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:34:46,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2023-11-29 05:34:47,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-29 05:34:47,008 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:34:47,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:47,009 INFO L85 PathProgramCache]: Analyzing trace with hash 991326124, now seen corresponding path program 1 times [2023-11-29 05:34:47,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:47,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535084642] [2023-11-29 05:34:47,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:47,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:34:47,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:34:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:34:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:34:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:34:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:34:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:34:47,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:34:47,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:34:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:34:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:34:47,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:34:47,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:34:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:34:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:34:47,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:34:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:34:47,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:34:47,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:34:47,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-29 05:34:47,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 05:34:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-29 05:34:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 05:34:47,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-29 05:34:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 05:34:47,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-11-29 05:34:47,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2023-11-29 05:34:47,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2023-11-29 05:34:47,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-11-29 05:34:47,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2023-11-29 05:34:47,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-11-29 05:34:47,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-11-29 05:34:47,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-11-29 05:34:47,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-11-29 05:34:47,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:47,167 INFO L134 CoverageAnalysis]: Checked inductivity of 911 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 867 trivial. 0 not checked. [2023-11-29 05:34:47,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:47,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535084642] [2023-11-29 05:34:47,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535084642] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:34:47,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:34:47,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:34:47,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583346354] [2023-11-29 05:34:47,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:34:47,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:34:47,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:47,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:34:47,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:34:47,169 INFO L87 Difference]: Start difference. First operand 7172 states and 8944 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 05:34:49,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:34:49,052 INFO L93 Difference]: Finished difference Result 14546 states and 18106 transitions. [2023-11-29 05:34:49,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:34:49,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 358 [2023-11-29 05:34:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:34:49,070 INFO L225 Difference]: With dead ends: 14546 [2023-11-29 05:34:49,070 INFO L226 Difference]: Without dead ends: 7066 [2023-11-29 05:34:49,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:34:49,077 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 114 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:34:49,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 588 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 05:34:49,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7066 states. [2023-11-29 05:34:50,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7066 to 7066. [2023-11-29 05:34:50,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7066 states, 5489 states have (on average 1.2089633813080707) internal successors, (6636), 5599 states have internal predecessors, (6636), 1009 states have call successors, (1009), 567 states have call predecessors, (1009), 567 states have return successors, (1009), 899 states have call predecessors, (1009), 1009 states have call successors, (1009) [2023-11-29 05:34:50,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7066 states to 7066 states and 8654 transitions. [2023-11-29 05:34:50,910 INFO L78 Accepts]: Start accepts. Automaton has 7066 states and 8654 transitions. Word has length 358 [2023-11-29 05:34:50,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:34:50,910 INFO L495 AbstractCegarLoop]: Abstraction has 7066 states and 8654 transitions. [2023-11-29 05:34:50,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2023-11-29 05:34:50,910 INFO L276 IsEmpty]: Start isEmpty. Operand 7066 states and 8654 transitions. [2023-11-29 05:34:50,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2023-11-29 05:34:50,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:34:50,921 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:34:50,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2023-11-29 05:34:50,921 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:34:50,921 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:34:50,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1041302862, now seen corresponding path program 1 times [2023-11-29 05:34:50,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:34:50,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012715742] [2023-11-29 05:34:50,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:50,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:34:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:34:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:34:51,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:34:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:34:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:34:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:34:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:34:51,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:34:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:34:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:34:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:34:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:34:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:34:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:34:51,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:34:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:34:51,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:34:51,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:34:51,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:34:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:34:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-29 05:34:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 05:34:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-29 05:34:51,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 05:34:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-29 05:34:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 05:34:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-11-29 05:34:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2023-11-29 05:34:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2023-11-29 05:34:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-11-29 05:34:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2023-11-29 05:34:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-11-29 05:34:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-11-29 05:34:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-11-29 05:34:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-11-29 05:34:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2023-11-29 05:34:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,628 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 48 proven. 48 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2023-11-29 05:34:51,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:34:51,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012715742] [2023-11-29 05:34:51,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012715742] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:34:51,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380262802] [2023-11-29 05:34:51,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:34:51,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:34:51,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:34:51,630 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:34:51,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-11-29 05:34:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:34:51,875 INFO L262 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 05:34:51,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:34:52,197 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 274 proven. 100 refuted. 0 times theorem prover too weak. 594 trivial. 0 not checked. [2023-11-29 05:34:52,197 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:34:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 56 proven. 51 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2023-11-29 05:34:52,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380262802] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:34:52,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:34:52,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2023-11-29 05:34:52,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916410998] [2023-11-29 05:34:52,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:34:52,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 05:34:52,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:34:52,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 05:34:52,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2023-11-29 05:34:52,784 INFO L87 Difference]: Start difference. First operand 7066 states and 8654 transitions. Second operand has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 19 states have internal predecessors, (203), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) [2023-11-29 05:35:02,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:02,987 INFO L93 Difference]: Finished difference Result 29691 states and 37026 transitions. [2023-11-29 05:35:02,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2023-11-29 05:35:02,988 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 19 states have internal predecessors, (203), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) Word has length 368 [2023-11-29 05:35:02,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:03,033 INFO L225 Difference]: With dead ends: 29691 [2023-11-29 05:35:03,033 INFO L226 Difference]: Without dead ends: 23342 [2023-11-29 05:35:03,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 817 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=731, Invalid=3429, Unknown=0, NotChecked=0, Total=4160 [2023-11-29 05:35:03,042 INFO L413 NwaCegarLoop]: 676 mSDtfsCounter, 1580 mSDsluCounter, 6889 mSDsCounter, 0 mSdLazyCounter, 4298 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1601 SdHoareTripleChecker+Valid, 7565 SdHoareTripleChecker+Invalid, 4856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 4298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:03,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1601 Valid, 7565 Invalid, 4856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 4298 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2023-11-29 05:35:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23342 states. [2023-11-29 05:35:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23342 to 11726. [2023-11-29 05:35:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11726 states, 9004 states have (on average 1.206796979120391) internal successors, (10866), 9192 states have internal predecessors, (10866), 1768 states have call successors, (1768), 953 states have call predecessors, (1768), 953 states have return successors, (1768), 1580 states have call predecessors, (1768), 1768 states have call successors, (1768) [2023-11-29 05:35:06,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11726 states to 11726 states and 14402 transitions. [2023-11-29 05:35:06,454 INFO L78 Accepts]: Start accepts. Automaton has 11726 states and 14402 transitions. Word has length 368 [2023-11-29 05:35:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:06,454 INFO L495 AbstractCegarLoop]: Abstraction has 11726 states and 14402 transitions. [2023-11-29 05:35:06,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.826086956521738) internal successors, (203), 19 states have internal predecessors, (203), 5 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (49), 7 states have call predecessors, (49), 4 states have call successors, (49) [2023-11-29 05:35:06,454 INFO L276 IsEmpty]: Start isEmpty. Operand 11726 states and 14402 transitions. [2023-11-29 05:35:06,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2023-11-29 05:35:06,473 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:06,473 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2023-11-29 05:35:06,479 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2023-11-29 05:35:06,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:35:06,674 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:35:06,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 46198595, now seen corresponding path program 1 times [2023-11-29 05:35:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:06,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236884337] [2023-11-29 05:35:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:06,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:35:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:35:07,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:35:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:35:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:35:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:35:07,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:35:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:35:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:35:07,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:35:07,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:35:07,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:35:07,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:35:07,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:35:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:35:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:35:07,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:35:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:35:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 05:35:07,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2023-11-29 05:35:07,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 05:35:07,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-29 05:35:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 05:35:07,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-29 05:35:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 05:35:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2023-11-29 05:35:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2023-11-29 05:35:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2023-11-29 05:35:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-11-29 05:35:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2023-11-29 05:35:07,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2023-11-29 05:35:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2023-11-29 05:35:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-11-29 05:35:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-11-29 05:35:07,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 353 [2023-11-29 05:35:07,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,772 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 16 proven. 22 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2023-11-29 05:35:07,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236884337] [2023-11-29 05:35:07,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236884337] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:35:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452089176] [2023-11-29 05:35:07,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:07,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:35:07,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:35:07,774 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:35:07,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-11-29 05:35:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:07,969 INFO L262 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 05:35:07,975 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:35:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 342 proven. 126 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2023-11-29 05:35:08,414 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:35:09,114 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 41 proven. 204 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2023-11-29 05:35:09,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452089176] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:35:09,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:35:09,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 18] total 41 [2023-11-29 05:35:09,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506934295] [2023-11-29 05:35:09,115 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:35:09,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-29 05:35:09,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:09,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-29 05:35:09,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=1533, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 05:35:09,118 INFO L87 Difference]: Start difference. First operand 11726 states and 14402 transitions. Second operand has 41 states, 40 states have (on average 7.25) internal successors, (290), 35 states have internal predecessors, (290), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 17 states have call predecessors, (80), 13 states have call successors, (80) [2023-11-29 05:35:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:35:51,454 INFO L93 Difference]: Finished difference Result 63562 states and 84804 transitions. [2023-11-29 05:35:51,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 227 states. [2023-11-29 05:35:51,455 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 7.25) internal successors, (290), 35 states have internal predecessors, (290), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 17 states have call predecessors, (80), 13 states have call successors, (80) Word has length 368 [2023-11-29 05:35:51,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:35:51,574 INFO L225 Difference]: With dead ends: 63562 [2023-11-29 05:35:51,574 INFO L226 Difference]: Without dead ends: 52579 [2023-11-29 05:35:51,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1066 GetRequests, 802 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26657 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=5481, Invalid=65009, Unknown=0, NotChecked=0, Total=70490 [2023-11-29 05:35:51,596 INFO L413 NwaCegarLoop]: 628 mSDtfsCounter, 4225 mSDsluCounter, 14454 mSDsCounter, 0 mSdLazyCounter, 16712 mSolverCounterSat, 1489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 15082 SdHoareTripleChecker+Invalid, 18201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1489 IncrementalHoareTripleChecker+Valid, 16712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:35:51,596 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 15082 Invalid, 18201 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1489 Valid, 16712 Invalid, 0 Unknown, 0 Unchecked, 10.0s Time] [2023-11-29 05:35:51,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52579 states. [2023-11-29 05:35:56,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52579 to 14384. [2023-11-29 05:35:56,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14384 states, 11073 states have (on average 1.203377585116951) internal successors, (13325), 11286 states have internal predecessors, (13325), 2138 states have call successors, (2138), 1170 states have call predecessors, (2138), 1172 states have return successors, (2142), 1927 states have call predecessors, (2142), 2138 states have call successors, (2142) [2023-11-29 05:35:56,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14384 states to 14384 states and 17605 transitions. [2023-11-29 05:35:56,374 INFO L78 Accepts]: Start accepts. Automaton has 14384 states and 17605 transitions. Word has length 368 [2023-11-29 05:35:56,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:35:56,375 INFO L495 AbstractCegarLoop]: Abstraction has 14384 states and 17605 transitions. [2023-11-29 05:35:56,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 7.25) internal successors, (290), 35 states have internal predecessors, (290), 14 states have call successors, (79), 10 states have call predecessors, (79), 13 states have return successors, (80), 17 states have call predecessors, (80), 13 states have call successors, (80) [2023-11-29 05:35:56,375 INFO L276 IsEmpty]: Start isEmpty. Operand 14384 states and 17605 transitions. [2023-11-29 05:35:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2023-11-29 05:35:56,398 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:35:56,398 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:35:56,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2023-11-29 05:35:56,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:35:56,598 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:35:56,599 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:35:56,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1216291840, now seen corresponding path program 1 times [2023-11-29 05:35:56,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:35:56,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027460175] [2023-11-29 05:35:56,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:56,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:35:56,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:35:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:35:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2023-11-29 05:35:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-29 05:35:56,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-29 05:35:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:35:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:35:56,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:35:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 05:35:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:35:56,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:35:56,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:35:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 05:35:56,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:35:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:35:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:35:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 05:35:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2023-11-29 05:35:56,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2023-11-29 05:35:56,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-29 05:35:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2023-11-29 05:35:56,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 05:35:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2023-11-29 05:35:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-29 05:35:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2023-11-29 05:35:56,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-11-29 05:35:56,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-11-29 05:35:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-11-29 05:35:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2023-11-29 05:35:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2023-11-29 05:35:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-11-29 05:35:56,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-11-29 05:35:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-11-29 05:35:56,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2023-11-29 05:35:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2023-11-29 05:35:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 357 [2023-11-29 05:35:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,748 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2023-11-29 05:35:56,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:35:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027460175] [2023-11-29 05:35:56,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027460175] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:35:56,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2131352895] [2023-11-29 05:35:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:35:56,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:35:56,749 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:35:56,750 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:35:56,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2023-11-29 05:35:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:35:56,939 INFO L262 TraceCheckSpWp]: Trace formula consists of 1279 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:35:56,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:35:56,958 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 894 trivial. 0 not checked. [2023-11-29 05:35:56,959 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:35:56,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2131352895] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:35:56,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 05:35:56,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2023-11-29 05:35:56,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645341416] [2023-11-29 05:35:56,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:35:56,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:35:56,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:35:56,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:35:56,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:35:56,961 INFO L87 Difference]: Start difference. First operand 14384 states and 17605 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 05:36:01,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:36:01,273 INFO L93 Difference]: Finished difference Result 28213 states and 34582 transitions. [2023-11-29 05:36:01,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:36:01,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 371 [2023-11-29 05:36:01,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:36:01,304 INFO L225 Difference]: With dead ends: 28213 [2023-11-29 05:36:01,304 INFO L226 Difference]: Without dead ends: 13829 [2023-11-29 05:36:01,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 443 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:36:01,319 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 28 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:36:01,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 646 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:36:01,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13829 states. [2023-11-29 05:36:05,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13829 to 13829. [2023-11-29 05:36:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13829 states, 10627 states have (on average 1.2055142561400207) internal successors, (12811), 10840 states have internal predecessors, (12811), 2079 states have call successors, (2079), 1122 states have call predecessors, (2079), 1122 states have return successors, (2079), 1866 states have call predecessors, (2079), 2079 states have call successors, (2079) [2023-11-29 05:36:05,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13829 states to 13829 states and 16969 transitions. [2023-11-29 05:36:05,442 INFO L78 Accepts]: Start accepts. Automaton has 13829 states and 16969 transitions. Word has length 371 [2023-11-29 05:36:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:36:05,442 INFO L495 AbstractCegarLoop]: Abstraction has 13829 states and 16969 transitions. [2023-11-29 05:36:05,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2023-11-29 05:36:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 13829 states and 16969 transitions. [2023-11-29 05:36:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2023-11-29 05:36:05,457 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:05,457 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:36:05,463 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2023-11-29 05:36:05,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2023-11-29 05:36:05,658 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:05,658 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:05,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1029702023, now seen corresponding path program 1 times [2023-11-29 05:36:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:05,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806640700] [2023-11-29 05:36:05,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:05,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:05,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:36:06,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:36:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:36:06,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:36:06,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:36:06,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:36:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:36:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:36:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:36:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:36:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:36:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:36:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:36:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:36:06,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:36:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:36:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:36:06,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:36:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2023-11-29 05:36:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2023-11-29 05:36:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-29 05:36:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 05:36:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2023-11-29 05:36:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2023-11-29 05:36:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2023-11-29 05:36:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 05:36:06,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2023-11-29 05:36:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-11-29 05:36:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 294 [2023-11-29 05:36:06,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2023-11-29 05:36:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2023-11-29 05:36:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2023-11-29 05:36:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2023-11-29 05:36:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-11-29 05:36:06,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2023-11-29 05:36:06,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2023-11-29 05:36:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 364 [2023-11-29 05:36:06,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 88 proven. 172 refuted. 0 times theorem prover too weak. 778 trivial. 0 not checked. [2023-11-29 05:36:06,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806640700] [2023-11-29 05:36:06,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806640700] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:36:06,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700055726] [2023-11-29 05:36:06,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:06,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:36:06,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:36:06,394 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:36:06,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2023-11-29 05:36:06,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:06,625 INFO L262 TraceCheckSpWp]: Trace formula consists of 1304 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 05:36:06,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:36:07,006 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 367 proven. 83 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2023-11-29 05:36:07,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:36:07,400 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 53 proven. 46 refuted. 0 times theorem prover too weak. 939 trivial. 0 not checked. [2023-11-29 05:36:07,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700055726] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:36:07,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:36:07,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 10] total 33 [2023-11-29 05:36:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663537907] [2023-11-29 05:36:07,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:36:07,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 05:36:07,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:07,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 05:36:07,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=971, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 05:36:07,403 INFO L87 Difference]: Start difference. First operand 13829 states and 16969 transitions. Second operand has 33 states, 31 states have (on average 9.0) internal successors, (279), 28 states have internal predecessors, (279), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2023-11-29 05:36:16,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:36:16,499 INFO L93 Difference]: Finished difference Result 27567 states and 34223 transitions. [2023-11-29 05:36:16,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-29 05:36:16,499 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 9.0) internal successors, (279), 28 states have internal predecessors, (279), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) Word has length 378 [2023-11-29 05:36:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:36:16,525 INFO L225 Difference]: With dead ends: 27567 [2023-11-29 05:36:16,526 INFO L226 Difference]: Without dead ends: 13559 [2023-11-29 05:36:16,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 905 GetRequests, 817 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1828 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=765, Invalid=7067, Unknown=0, NotChecked=0, Total=7832 [2023-11-29 05:36:16,542 INFO L413 NwaCegarLoop]: 324 mSDtfsCounter, 1366 mSDsluCounter, 6519 mSDsCounter, 0 mSdLazyCounter, 4624 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1393 SdHoareTripleChecker+Valid, 6843 SdHoareTripleChecker+Invalid, 5128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 4624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 05:36:16,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1393 Valid, 6843 Invalid, 5128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 4624 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 05:36:16,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13559 states. [2023-11-29 05:36:19,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13559 to 7983. [2023-11-29 05:36:19,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7983 states, 6206 states have (on average 1.1956171446986787) internal successors, (7420), 6278 states have internal predecessors, (7420), 1134 states have call successors, (1134), 642 states have call predecessors, (1134), 642 states have return successors, (1134), 1062 states have call predecessors, (1134), 1134 states have call successors, (1134) [2023-11-29 05:36:19,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7983 states to 7983 states and 9688 transitions. [2023-11-29 05:36:19,248 INFO L78 Accepts]: Start accepts. Automaton has 7983 states and 9688 transitions. Word has length 378 [2023-11-29 05:36:19,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:36:19,248 INFO L495 AbstractCegarLoop]: Abstraction has 7983 states and 9688 transitions. [2023-11-29 05:36:19,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 9.0) internal successors, (279), 28 states have internal predecessors, (279), 9 states have call successors, (65), 7 states have call predecessors, (65), 15 states have return successors, (65), 12 states have call predecessors, (65), 9 states have call successors, (65) [2023-11-29 05:36:19,248 INFO L276 IsEmpty]: Start isEmpty. Operand 7983 states and 9688 transitions. [2023-11-29 05:36:19,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2023-11-29 05:36:19,255 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:19,256 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:36:19,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2023-11-29 05:36:19,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:36:19,456 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:19,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:19,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1147352036, now seen corresponding path program 1 times [2023-11-29 05:36:19,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:19,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589932423] [2023-11-29 05:36:19,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:19,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:36:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:36:19,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:36:19,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:36:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:36:19,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:36:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:36:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:36:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:36:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:36:19,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:36:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:36:19,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:36:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:36:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:36:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:36:19,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:36:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:36:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:36:19,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2023-11-29 05:36:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2023-11-29 05:36:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-29 05:36:19,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2023-11-29 05:36:19,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2023-11-29 05:36:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2023-11-29 05:36:19,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 274 [2023-11-29 05:36:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2023-11-29 05:36:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2023-11-29 05:36:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2023-11-29 05:36:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-11-29 05:36:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2023-11-29 05:36:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2023-11-29 05:36:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 335 [2023-11-29 05:36:19,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2023-11-29 05:36:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2023-11-29 05:36:19,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2023-11-29 05:36:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2023-11-29 05:36:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2023-11-29 05:36:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:19,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 136 proven. 128 refuted. 0 times theorem prover too weak. 838 trivial. 0 not checked. [2023-11-29 05:36:19,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589932423] [2023-11-29 05:36:19,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589932423] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:36:19,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597804019] [2023-11-29 05:36:19,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:19,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:36:19,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:36:19,973 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:36:19,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2023-11-29 05:36:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:20,231 INFO L262 TraceCheckSpWp]: Trace formula consists of 1330 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 05:36:20,237 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:36:20,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 431 proven. 87 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2023-11-29 05:36:20,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:36:21,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1102 backedges. 51 proven. 34 refuted. 0 times theorem prover too weak. 1017 trivial. 0 not checked. [2023-11-29 05:36:21,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597804019] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:36:21,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:36:21,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 10] total 33 [2023-11-29 05:36:21,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874112935] [2023-11-29 05:36:21,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:36:21,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 05:36:21,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:21,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 05:36:21,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2023-11-29 05:36:21,050 INFO L87 Difference]: Start difference. First operand 7983 states and 9688 transitions. Second operand has 33 states, 31 states have (on average 9.64516129032258) internal successors, (299), 28 states have internal predecessors, (299), 10 states have call successors, (70), 8 states have call predecessors, (70), 15 states have return successors, (70), 12 states have call predecessors, (70), 10 states have call successors, (70) [2023-11-29 05:36:29,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:36:29,523 INFO L93 Difference]: Finished difference Result 17820 states and 21909 transitions. [2023-11-29 05:36:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2023-11-29 05:36:29,524 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 9.64516129032258) internal successors, (299), 28 states have internal predecessors, (299), 10 states have call successors, (70), 8 states have call predecessors, (70), 15 states have return successors, (70), 12 states have call predecessors, (70), 10 states have call successors, (70) Word has length 390 [2023-11-29 05:36:29,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:36:29,538 INFO L225 Difference]: With dead ends: 17820 [2023-11-29 05:36:29,538 INFO L226 Difference]: Without dead ends: 9603 [2023-11-29 05:36:29,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 931 GetRequests, 843 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1833 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=766, Invalid=7066, Unknown=0, NotChecked=0, Total=7832 [2023-11-29 05:36:29,545 INFO L413 NwaCegarLoop]: 337 mSDtfsCounter, 800 mSDsluCounter, 6931 mSDsCounter, 0 mSdLazyCounter, 4869 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 7268 SdHoareTripleChecker+Invalid, 5098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 4869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:36:29,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 7268 Invalid, 5098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 4869 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2023-11-29 05:36:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9603 states. [2023-11-29 05:36:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9603 to 7620. [2023-11-29 05:36:32,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7620 states, 5900 states have (on average 1.1861016949152543) internal successors, (6998), 5973 states have internal predecessors, (6998), 1082 states have call successors, (1082), 637 states have call predecessors, (1082), 637 states have return successors, (1082), 1009 states have call predecessors, (1082), 1082 states have call successors, (1082) [2023-11-29 05:36:32,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7620 states to 7620 states and 9162 transitions. [2023-11-29 05:36:32,222 INFO L78 Accepts]: Start accepts. Automaton has 7620 states and 9162 transitions. Word has length 390 [2023-11-29 05:36:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:36:32,223 INFO L495 AbstractCegarLoop]: Abstraction has 7620 states and 9162 transitions. [2023-11-29 05:36:32,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 9.64516129032258) internal successors, (299), 28 states have internal predecessors, (299), 10 states have call successors, (70), 8 states have call predecessors, (70), 15 states have return successors, (70), 12 states have call predecessors, (70), 10 states have call successors, (70) [2023-11-29 05:36:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 7620 states and 9162 transitions. [2023-11-29 05:36:32,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2023-11-29 05:36:32,229 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:32,230 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 11, 9, 8, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:36:32,235 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2023-11-29 05:36:32,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2023-11-29 05:36:32,430 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:32,431 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:32,431 INFO L85 PathProgramCache]: Analyzing trace with hash 233055769, now seen corresponding path program 1 times [2023-11-29 05:36:32,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:32,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568031492] [2023-11-29 05:36:32,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:32,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:32,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:36:32,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:36:32,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:36:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:36:32,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:36:32,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:36:32,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:36:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:36:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:36:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:36:32,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:36:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:36:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:36:32,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:36:32,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:36:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:36:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:36:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:36:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:36:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2023-11-29 05:36:32,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 05:36:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2023-11-29 05:36:32,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2023-11-29 05:36:32,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 05:36:32,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2023-11-29 05:36:32,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2023-11-29 05:36:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 280 [2023-11-29 05:36:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2023-11-29 05:36:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2023-11-29 05:36:32,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2023-11-29 05:36:32,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 317 [2023-11-29 05:36:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2023-11-29 05:36:32,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2023-11-29 05:36:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2023-11-29 05:36:32,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 345 [2023-11-29 05:36:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 361 [2023-11-29 05:36:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2023-11-29 05:36:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 375 [2023-11-29 05:36:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 384 [2023-11-29 05:36:32,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2023-11-29 05:36:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 400 [2023-11-29 05:36:32,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 408 [2023-11-29 05:36:32,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 40 proven. 2 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2023-11-29 05:36:32,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:32,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568031492] [2023-11-29 05:36:32,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568031492] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:36:32,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153016787] [2023-11-29 05:36:32,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:32,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:36:32,657 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:36:32,658 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:36:32,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2023-11-29 05:36:32,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:32,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 1442 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 05:36:32,878 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:36:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 187 proven. 400 refuted. 0 times theorem prover too weak. 675 trivial. 0 not checked. [2023-11-29 05:36:33,351 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:36:33,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1262 backedges. 23 proven. 30 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2023-11-29 05:36:33,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153016787] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:36:33,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:36:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2023-11-29 05:36:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321721] [2023-11-29 05:36:33,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:36:33,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-11-29 05:36:33,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:33,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-11-29 05:36:33,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2023-11-29 05:36:33,635 INFO L87 Difference]: Start difference. First operand 7620 states and 9162 transitions. Second operand has 20 states, 20 states have (on average 15.15) internal successors, (303), 17 states have internal predecessors, (303), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) [2023-11-29 05:36:46,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:36:46,987 INFO L93 Difference]: Finished difference Result 29707 states and 36058 transitions. [2023-11-29 05:36:46,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2023-11-29 05:36:46,988 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 15.15) internal successors, (303), 17 states have internal predecessors, (303), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) Word has length 421 [2023-11-29 05:36:46,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:36:47,019 INFO L225 Difference]: With dead ends: 29707 [2023-11-29 05:36:47,019 INFO L226 Difference]: Without dead ends: 22680 [2023-11-29 05:36:47,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1046 GetRequests, 941 SyntacticMatches, 9 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2950 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=963, Invalid=8543, Unknown=0, NotChecked=0, Total=9506 [2023-11-29 05:36:47,029 INFO L413 NwaCegarLoop]: 383 mSDtfsCounter, 1746 mSDsluCounter, 4126 mSDsCounter, 0 mSdLazyCounter, 4674 mSolverCounterSat, 587 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1760 SdHoareTripleChecker+Valid, 4509 SdHoareTripleChecker+Invalid, 5261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 587 IncrementalHoareTripleChecker+Valid, 4674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:36:47,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1760 Valid, 4509 Invalid, 5261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [587 Valid, 4674 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-11-29 05:36:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22680 states. [2023-11-29 05:36:51,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22680 to 11985. [2023-11-29 05:36:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11985 states, 9310 states have (on average 1.1792696025778733) internal successors, (10979), 9419 states have internal predecessors, (10979), 1668 states have call successors, (1668), 1006 states have call predecessors, (1668), 1006 states have return successors, (1668), 1559 states have call predecessors, (1668), 1668 states have call successors, (1668) [2023-11-29 05:36:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11985 states to 11985 states and 14315 transitions. [2023-11-29 05:36:51,376 INFO L78 Accepts]: Start accepts. Automaton has 11985 states and 14315 transitions. Word has length 421 [2023-11-29 05:36:51,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:36:51,377 INFO L495 AbstractCegarLoop]: Abstraction has 11985 states and 14315 transitions. [2023-11-29 05:36:51,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 15.15) internal successors, (303), 17 states have internal predecessors, (303), 7 states have call successors, (95), 7 states have call predecessors, (95), 9 states have return successors, (94), 9 states have call predecessors, (94), 7 states have call successors, (94) [2023-11-29 05:36:51,377 INFO L276 IsEmpty]: Start isEmpty. Operand 11985 states and 14315 transitions. [2023-11-29 05:36:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2023-11-29 05:36:51,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:36:51,384 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 11, 11, 11, 10, 10, 9, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:36:51,391 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2023-11-29 05:36:51,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:36:51,585 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:36:51,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:36:51,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1676009123, now seen corresponding path program 1 times [2023-11-29 05:36:51,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:36:51,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60777184] [2023-11-29 05:36:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:51,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:36:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 05:36:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2023-11-29 05:36:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 05:36:51,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 05:36:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2023-11-29 05:36:51,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2023-11-29 05:36:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 05:36:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-11-29 05:36:51,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 05:36:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 05:36:51,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:36:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:36:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2023-11-29 05:36:51,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 05:36:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 05:36:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-29 05:36:51,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2023-11-29 05:36:51,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2023-11-29 05:36:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2023-11-29 05:36:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2023-11-29 05:36:51,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2023-11-29 05:36:51,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2023-11-29 05:36:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2023-11-29 05:36:51,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2023-11-29 05:36:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2023-11-29 05:36:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2023-11-29 05:36:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2023-11-29 05:36:51,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2023-11-29 05:36:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2023-11-29 05:36:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2023-11-29 05:36:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 316 [2023-11-29 05:36:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2023-11-29 05:36:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2023-11-29 05:36:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 336 [2023-11-29 05:36:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2023-11-29 05:36:51,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2023-11-29 05:36:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 363 [2023-11-29 05:36:51,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 372 [2023-11-29 05:36:51,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 382 [2023-11-29 05:36:51,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 393 [2023-11-29 05:36:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2023-11-29 05:36:51,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 409 [2023-11-29 05:36:51,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:51,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 47 proven. 2 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2023-11-29 05:36:51,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:36:51,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60777184] [2023-11-29 05:36:51,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60777184] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 05:36:51,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191250298] [2023-11-29 05:36:51,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:36:51,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 05:36:51,825 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:36:51,826 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 05:36:51,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2023-11-29 05:36:52,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:36:52,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 1449 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 05:36:52,044 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:36:52,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 560 proven. 89 refuted. 0 times theorem prover too weak. 650 trivial. 0 not checked. [2023-11-29 05:36:52,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 05:36:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1299 backedges. 75 proven. 53 refuted. 0 times theorem prover too weak. 1171 trivial. 0 not checked. [2023-11-29 05:36:52,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191250298] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 05:36:52,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 05:36:52,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 13, 13] total 27 [2023-11-29 05:36:52,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617440781] [2023-11-29 05:36:52,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 05:36:52,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-11-29 05:36:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:36:52,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-11-29 05:36:52,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=630, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:36:52,769 INFO L87 Difference]: Start difference. First operand 11985 states and 14315 transitions. Second operand has 27 states, 27 states have (on average 9.851851851851851) internal successors, (266), 22 states have internal predecessors, (266), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) [2023-11-29 05:37:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:37:13,590 INFO L93 Difference]: Finished difference Result 40482 states and 48883 transitions. [2023-11-29 05:37:13,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2023-11-29 05:37:13,591 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 9.851851851851851) internal successors, (266), 22 states have internal predecessors, (266), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) Word has length 424 [2023-11-29 05:37:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:37:13,644 INFO L225 Difference]: With dead ends: 40482 [2023-11-29 05:37:13,644 INFO L226 Difference]: Without dead ends: 28998 [2023-11-29 05:37:13,656 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 954 SyntacticMatches, 1 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6987 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2310, Invalid=18860, Unknown=0, NotChecked=0, Total=21170 [2023-11-29 05:37:13,657 INFO L413 NwaCegarLoop]: 601 mSDtfsCounter, 3150 mSDsluCounter, 7894 mSDsCounter, 0 mSdLazyCounter, 6430 mSolverCounterSat, 1344 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3155 SdHoareTripleChecker+Valid, 8495 SdHoareTripleChecker+Invalid, 7774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1344 IncrementalHoareTripleChecker+Valid, 6430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 05:37:13,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3155 Valid, 8495 Invalid, 7774 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1344 Valid, 6430 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 05:37:13,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28998 states. [2023-11-29 05:37:20,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28998 to 17496. [2023-11-29 05:37:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17496 states, 13589 states have (on average 1.1655015085731106) internal successors, (15838), 13746 states have internal predecessors, (15838), 2361 states have call successors, (2361), 1545 states have call predecessors, (2361), 1545 states have return successors, (2361), 2204 states have call predecessors, (2361), 2361 states have call successors, (2361) [2023-11-29 05:37:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17496 states to 17496 states and 20560 transitions. [2023-11-29 05:37:20,732 INFO L78 Accepts]: Start accepts. Automaton has 17496 states and 20560 transitions. Word has length 424 [2023-11-29 05:37:20,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:37:20,733 INFO L495 AbstractCegarLoop]: Abstraction has 17496 states and 20560 transitions. [2023-11-29 05:37:20,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 9.851851851851851) internal successors, (266), 22 states have internal predecessors, (266), 5 states have call successors, (76), 9 states have call predecessors, (76), 15 states have return successors, (75), 9 states have call predecessors, (75), 5 states have call successors, (75) [2023-11-29 05:37:20,733 INFO L276 IsEmpty]: Start isEmpty. Operand 17496 states and 20560 transitions. [2023-11-29 05:37:20,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2023-11-29 05:37:20,744 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:37:20,745 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:37:20,750 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2023-11-29 05:37:20,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2023-11-29 05:37:20,945 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:37:20,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:37:20,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1384740635, now seen corresponding path program 1 times [2023-11-29 05:37:20,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:37:20,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959747953] [2023-11-29 05:37:20,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:37:20,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:37:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:37:20,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:37:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:37:21,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:37:21,165 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:37:21,166 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 05:37:21,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2023-11-29 05:37:21,170 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2023-11-29 05:37:21,174 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:37:21,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:37:21,268 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:37:21,271 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:37:21,272 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-29 05:37:21,276 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:37:21,278 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:37:21,280 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:37:21,281 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-29 05:37:21,283 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-29 05:37:21,285 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-29 05:37:21,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-29 05:37:21,287 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-29 05:37:21,289 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated [2023-11-29 05:37:21,290 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated [2023-11-29 05:37:21,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated [2023-11-29 05:37:21,292 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-29 05:37:21,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated [2023-11-29 05:37:21,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated [2023-11-29 05:37:21,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-11-29 05:37:21,299 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated [2023-11-29 05:37:21,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret18 could not be translated [2023-11-29 05:37:21,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated [2023-11-29 05:37:21,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-29 05:37:21,301 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret27 could not be translated [2023-11-29 05:37:21,305 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated [2023-11-29 05:37:21,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-29 05:37:21,306 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated [2023-11-29 05:37:21,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret24 could not be translated [2023-11-29 05:37:21,307 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret25 could not be translated [2023-11-29 05:37:21,308 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret26 could not be translated [2023-11-29 05:37:21,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:37:21 BoogieIcfgContainer [2023-11-29 05:37:21,351 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:37:21,351 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:37:21,351 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:37:21,351 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:37:21,352 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:32:50" (3/4) ... [2023-11-29 05:37:21,352 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-29 05:37:21,395 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:37:21,396 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:37:21,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated [2023-11-29 05:37:21,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated [2023-11-29 05:37:21,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:37:21,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:37:21,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated [2023-11-29 05:37:21,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated [2023-11-29 05:37:21,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-29 05:37:21,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-29 05:37:21,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated [2023-11-29 05:37:21,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated [2023-11-29 05:37:21,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated [2023-11-29 05:37:21,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated [2023-11-29 05:37:21,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated [2023-11-29 05:37:21,404 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated [2023-11-29 05:37:21,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated [2023-11-29 05:37:21,408 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated [2023-11-29 05:37:21,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated [2023-11-29 05:37:21,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated [2023-11-29 05:37:21,409 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret18 could not be translated [2023-11-29 05:37:21,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated [2023-11-29 05:37:21,410 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-29 05:37:21,411 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret27 could not be translated [2023-11-29 05:37:21,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated [2023-11-29 05:37:21,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated [2023-11-29 05:37:21,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated [2023-11-29 05:37:21,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret24 could not be translated [2023-11-29 05:37:21,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret25 could not be translated [2023-11-29 05:37:21,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ret26 could not be translated [2023-11-29 05:37:21,556 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 05:37:21,556 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:37:21,557 INFO L158 Benchmark]: Toolchain (without parser) took 272178.16ms. Allocated memory was 127.9MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 79.1MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-11-29 05:37:21,557 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 127.9MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:37:21,557 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.32ms. Allocated memory is still 127.9MB. Free memory was 78.8MB in the beginning and 62.6MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:37:21,557 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.31ms. Allocated memory is still 127.9MB. Free memory was 62.3MB in the beginning and 59.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:37:21,557 INFO L158 Benchmark]: Boogie Preprocessor took 81.57ms. Allocated memory is still 127.9MB. Free memory was 59.3MB in the beginning and 98.6MB in the end (delta: -39.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. [2023-11-29 05:37:21,558 INFO L158 Benchmark]: RCFGBuilder took 591.59ms. Allocated memory is still 127.9MB. Free memory was 98.2MB in the beginning and 65.3MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2023-11-29 05:37:21,558 INFO L158 Benchmark]: TraceAbstraction took 270898.81ms. Allocated memory was 127.9MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 64.4MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2023-11-29 05:37:21,558 INFO L158 Benchmark]: Witness Printer took 205.40ms. Allocated memory is still 3.7GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. [2023-11-29 05:37:21,559 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.19ms. Allocated memory is still 127.9MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.32ms. Allocated memory is still 127.9MB. Free memory was 78.8MB in the beginning and 62.6MB in the end (delta: 16.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.31ms. Allocated memory is still 127.9MB. Free memory was 62.3MB in the beginning and 59.6MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 81.57ms. Allocated memory is still 127.9MB. Free memory was 59.3MB in the beginning and 98.6MB in the end (delta: -39.4MB). Peak memory consumption was 11.6MB. Max. memory is 16.1GB. * RCFGBuilder took 591.59ms. Allocated memory is still 127.9MB. Free memory was 98.2MB in the beginning and 65.3MB in the end (delta: 32.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 270898.81ms. Allocated memory was 127.9MB in the beginning and 3.7GB in the end (delta: 3.6GB). Free memory was 64.4MB in the beginning and 1.7GB in the end (delta: -1.7GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. * Witness Printer took 205.40ms. Allocated memory is still 3.7GB. Free memory was 1.7GB in the beginning and 1.7GB in the end (delta: 46.1MB). Peak memory consumption was 46.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret26 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret4 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret10 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret12 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret16 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret18 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret20 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret22 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ret26 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 537]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L39] _Bool gate1Failed ; [L40] _Bool gate2Failed ; [L41] _Bool gate3Failed ; [L42] msg_t VALUE1 ; [L43] msg_t VALUE2 ; [L44] msg_t VALUE3 ; [L46] _Bool gate1Failed_History_0 ; [L47] _Bool gate1Failed_History_1 ; [L48] _Bool gate1Failed_History_2 ; [L49] _Bool gate2Failed_History_0 ; [L50] _Bool gate2Failed_History_1 ; [L51] _Bool gate2Failed_History_2 ; [L52] _Bool gate3Failed_History_0 ; [L53] _Bool gate3Failed_History_1 ; [L54] _Bool gate3Failed_History_2 ; [L55] int8_t votedValue_History_0 ; [L56] int8_t votedValue_History_1 ; [L57] int8_t votedValue_History_2 ; [L479] int c1 ; [L480] int i2 ; [L483] c1 = 0 [L484] gate1Failed = __VERIFIER_nondet_bool() [L485] gate2Failed = __VERIFIER_nondet_bool() [L486] gate3Failed = __VERIFIER_nondet_bool() [L487] VALUE1 = __VERIFIER_nondet_char() [L488] VALUE2 = __VERIFIER_nondet_char() [L489] VALUE3 = __VERIFIER_nondet_char() [L490] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L496] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L497] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L498] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L499] votedValue_History_0 = __VERIFIER_nondet_char() [L500] votedValue_History_1 = __VERIFIER_nondet_char() [L501] votedValue_History_2 = __VERIFIER_nondet_char() [L502] CALL, EXPR init() [L206] int tmp ; [L207] int tmp___0 ; [L208] int tmp___1 ; [L209] int tmp___2 ; VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L212] CALL, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] CALL, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L130] COND TRUE historyIndex == 0 [L131] return (gate1Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] RET, EXPR read_history_bool(0, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L76] tmp = (int )read_history_bool(0, 0) [L77] COND FALSE !(! (tmp == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L212] RET, EXPR add_history_type(0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L212] tmp = add_history_type(0) [L213] COND FALSE !(! tmp) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L216] CALL, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] CALL, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L140] COND TRUE historyIndex == 0 [L141] return (gate2Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=1, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] RET, EXPR read_history_bool(1, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L82] tmp___0 = (int )read_history_bool(1, 0) [L83] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L216] RET, EXPR add_history_type(1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L216] tmp___0 = add_history_type(1) [L217] COND FALSE !(! tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L220] CALL, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] CALL, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L150] COND TRUE historyIndex == 0 [L151] return (gate3Failed_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=2, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] RET, EXPR read_history_bool(2, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L88] tmp___1 = (int )read_history_bool(2, 0) [L89] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L220] RET, EXPR add_history_type(2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L220] tmp___1 = add_history_type(2) [L221] COND FALSE !(! tmp___1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L224] CALL, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L62] _Bool ini_bool ; [L63] int8_t ini_int ; [L64] int var ; [L65] int tmp ; [L66] int tmp___0 ; [L67] int tmp___1 ; [L68] int tmp___2 ; [L71] ini_bool = (_Bool)0 [L72] ini_int = (int8_t )-2 [L73] var = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L93] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L93] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND TRUE var < 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L75] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L81] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L87] COND FALSE !(history_id == 2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L93] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L94] tmp___2 = (int )read_history_int8(3, 0) [L95] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L99] var ++ VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L74] COND FALSE !(var < 3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L101] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L224] RET, EXPR add_history_type(3) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L224] tmp___2 = add_history_type(3) [L225] COND FALSE !(! tmp___2) [L228] return (1); VAL [VALUE1=0, VALUE2=0, VALUE3=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L502] RET, EXPR init() [L502] i2 = init() [L503] CALL assume_abort_if_not(i2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, cond=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L503] RET assume_abort_if_not(i2) VAL [VALUE1=0, VALUE2=0, VALUE3=0, c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L504] g1v_old = nomsg [L505] g1v_new = nomsg [L506] g2v_old = nomsg [L507] g2v_new = nomsg [L508] g3v_old = nomsg [L509] g3v_new = nomsg [L510] i2 = 0 VAL [VALUE1=0, VALUE2=0, VALUE3=0, c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=2, \old(gate1Failed_History_2)=3, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=2, gate1Failed_History_2=3, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=2, \old(gate1Failed_History_2)=3, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \old(history_id)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=0, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L347] RET write_history_bool(0, gate1Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L348] COND TRUE \read(gate1Failed) [L349] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=6, gate2Failed_History_2=7, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=6, \old(gate2Failed_History_2)=7, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=1, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L378] RET write_history_bool(1, gate2Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=4, gate3Failed_History_2=5, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=4, \old(gate3Failed_History_2)=5, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=2, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L409] RET write_history_bool(2, gate3Failed) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L410] COND FALSE !(\read(gate3Failed)) [L414] tmp = __VERIFIER_nondet_char() [L415] next_state = tmp VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L416] COND TRUE (int )next_state == 0 [L417] tmp___0 = 1 VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] CALL assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [VALUE1=0, VALUE2=0, VALUE3=0, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L427] RET assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L428] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [VALUE1=0, VALUE2=0, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0, voted_value=-1] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND FALSE !(! gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L258] COND TRUE ! gate3Failed [L259] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=0, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND TRUE ! tmp___3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L266] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L139] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L266] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L266] tmp___4 = read_history_bool(1, 1) [L267] COND TRUE ! tmp___4 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L149] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___5 = read_history_bool(2, 1) [L269] COND TRUE ! tmp___5 [L270] temp_count = 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L271] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L271] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L271] tmp___0 = read_history_int8(3, 0) [L272] COND TRUE (int )VALUE1 == (int )tmp___0 [L273] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L275] tmp___1 = read_history_int8(3, 0) [L276] COND TRUE (int )VALUE2 == (int )tmp___1 [L277] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L279] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L279] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L279] tmp___2 = read_history_int8(3, 0) [L280] COND TRUE (int )VALUE3 == (int )tmp___2 [L281] temp_count ++ VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L283] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L297] COND FALSE !(! (temp_count > 1)) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L303] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=1, \old(history_id)=3, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L303] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND FALSE !((int )tmp___10 > -2) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L323] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L323] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L323] tmp___11 = read_history_int8(3, 0) [L324] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___11=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L336] return (1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___10=-2, tmp___11=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L523] RET, EXPR check() [L523] c1 = check() [L524] CALL assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L535] COND FALSE !(! arg) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L524] RET assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, i2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] COND TRUE 1 [L513] CALL gate1_each_pals_period() [L341] int8_t next_state ; [L342] msg_t tmp ; [L343] int tmp___0 ; [L346] gate1Failed = __VERIFIER_nondet_bool() [L347] CALL write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=2, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND TRUE history_id == 0 [L185] gate1Failed_History_2 = gate1Failed_History_1 [L186] gate1Failed_History_1 = gate1Failed_History_0 [L187] gate1Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L347] RET write_history_bool(0, gate1Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L348] COND FALSE !(\read(gate1Failed)) [L352] tmp = __VERIFIER_nondet_char() [L353] next_state = tmp VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L354] COND TRUE (int )next_state == 0 [L355] tmp___0 = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] CALL assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L365] RET assume_abort_if_not((_Bool )tmp___0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L366] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, next_state=0, nomsg=-1, tmp=0, tmp___0=1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L513] RET gate1_each_pals_period() [L514] CALL gate2_each_pals_period() [L372] int8_t next_state ; [L373] msg_t tmp ; [L374] int tmp___0 ; [L377] gate2Failed = __VERIFIER_nondet_bool() [L378] CALL write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=6, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] COND TRUE history_id == 1 [L190] gate2Failed_History_2 = gate2Failed_History_1 [L191] gate2Failed_History_1 = gate2Failed_History_0 [L192] gate2Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=6, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L378] RET write_history_bool(1, gate2Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L379] COND TRUE \read(gate2Failed) [L380] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L514] RET gate2_each_pals_period() [L515] CALL gate3_each_pals_period() [L403] int8_t next_state ; [L404] msg_t tmp ; [L405] int tmp___0 ; [L408] gate3Failed = __VERIFIER_nondet_bool() [L409] CALL write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L184] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L189] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=4, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L194] COND TRUE history_id == 2 [L195] gate3Failed_History_2 = gate3Failed_History_1 [L196] gate3Failed_History_1 = gate3Failed_History_0 [L197] gate3Failed_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, \old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=4, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L409] RET write_history_bool(2, gate3Failed) VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L410] COND TRUE \read(gate3Failed) [L411] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [VALUE1=-1, VALUE2=-1, VALUE3=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L515] RET gate3_each_pals_period() [L516] CALL voter() [L434] int8_t voted_value ; [L437] voted_value = nomsg [L438] VALUE1 = g1v_old [L439] g1v_old = nomsg [L440] VALUE2 = g2v_old [L441] g2v_old = nomsg [L442] VALUE3 = g3v_old [L443] g3v_old = nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L444] COND TRUE (int )VALUE1 == (int )VALUE2 [L445] voted_value = VALUE1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0, voted_value=-1] [L473] CALL write_history_int8(3, voted_value) [L169] COND TRUE history_id == 3 [L170] votedValue_History_2 = votedValue_History_1 [L171] votedValue_History_1 = votedValue_History_0 [L172] votedValue_History_0 = buf VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L473] RET write_history_int8(3, voted_value) [L516] RET voter() [L517] g1v_old = g1v_new [L518] g1v_new = nomsg [L519] g2v_old = g2v_new [L520] g2v_new = nomsg [L521] g3v_old = g3v_new [L522] g3v_new = nomsg [L523] CALL, EXPR check() [L233] int tmp ; [L234] int temp_count ; [L235] int8_t tmp___0 ; [L236] int8_t tmp___1 ; [L237] int8_t tmp___2 ; [L238] _Bool tmp___3 ; [L239] _Bool tmp___4 ; [L240] _Bool tmp___5 ; [L241] int8_t tmp___6 ; [L242] _Bool tmp___7 ; [L243] _Bool tmp___8 ; [L244] _Bool tmp___9 ; [L245] int8_t tmp___10 ; [L246] int8_t tmp___11 ; [L247] int8_t tmp___12 ; [L248] int8_t tmp___13 ; [L249] int8_t tmp___14 ; VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L252] COND TRUE ! gate1Failed [L253] tmp = 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] CALL assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(cond)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L37] COND FALSE !(!cond) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(cond)=1, cond=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L263] RET assume_abort_if_not((_Bool )tmp) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L264] tmp___3 = read_history_bool(0, 1) [L265] COND FALSE !(! tmp___3) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] CALL, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L113] COND TRUE historyIndex == 1 [L114] return (votedValue_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] RET, EXPR read_history_int8(3, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L303] tmp___10 = read_history_int8(3, 1) [L304] COND TRUE (int )tmp___10 > -2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] CALL, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L109] COND TRUE history_id == 3 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 0 [L111] return (votedValue_History_0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=0, \old(history_id)=3, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=0, history_id=3, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] RET, EXPR read_history_int8(3, 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L305] tmp___6 = read_history_int8(3, 0) [L306] COND TRUE (int )tmp___6 == (int )nomsg VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] CALL, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND TRUE history_id == 0 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L133] COND TRUE historyIndex == 1 [L134] return (gate1Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=0, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] RET, EXPR read_history_bool(0, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L307] tmp___7 = read_history_bool(0, 1) [L308] COND TRUE \read(tmp___7) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] CALL, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND TRUE history_id == 1 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L143] COND TRUE historyIndex == 1 [L144] return (gate2Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=1, \result=-255, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=1, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] RET, EXPR read_history_bool(1, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L309] tmp___8 = read_history_bool(1, 1) [L310] COND TRUE \read(tmp___8) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] CALL, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L129] COND FALSE !(history_id == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L139] COND FALSE !(history_id == 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L149] COND TRUE history_id == 2 VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND FALSE !(historyIndex == 0) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L153] COND TRUE historyIndex == 1 [L154] return (gate3Failed_History_1); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(historyIndex)=1, \old(history_id)=2, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, historyIndex=1, history_id=2, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] RET, EXPR read_history_bool(2, 1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L311] tmp___9 = read_history_bool(2, 1) [L312] COND TRUE ! tmp___9 [L313] return (0); VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L523] RET, EXPR check() [L523] c1 = check() [L524] CALL assert(c1) VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] COND TRUE ! arg VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L537] reach_error() VAL [VALUE1=-1, VALUE2=-1, VALUE3=0, \old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 174 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 270.7s, OverallIterations: 48, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 199.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31135 SdHoareTripleChecker+Valid, 50.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 30707 mSDsluCounter, 111885 SdHoareTripleChecker+Invalid, 44.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97444 mSDsCounter, 10510 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 82812 IncrementalHoareTripleChecker+Invalid, 93322 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10510 mSolverCounterUnsat, 14441 mSDtfsCounter, 82812 mSolverCounterSat, 0.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14166 GetRequests, 12238 SyntacticMatches, 37 SemanticMatches, 1891 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 215662 ImplicationChecksByTransitivity, 71.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17496occurred in iteration=47, InterpolantAutomatonStates: 1702, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 39.2s AutomataMinimizationTime, 47 MinimizatonAttempts, 142915 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.0s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 17445 NumberOfCodeBlocks, 17445 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 20798 ConstructedInterpolants, 0 QuantifiedInterpolants, 42341 SizeOfPredicates, 63 NumberOfNonLiveVariables, 21213 ConjunctsInSsa, 372 ConjunctsInUnsatCore, 80 InterpolantComputations, 37 PerfectInterpolantSequences, 51329/53844 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-11-29 05:37:21,593 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_65d247c9-cfec-485f-8a34-4729b633153c/bin/uautomizer-verify-BQ2R08f2Ya/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