./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd --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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:41:46,751 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:41:46,866 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 14:41:46,874 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:41:46,875 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:41:46,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:41:46,919 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:41:46,920 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:41:46,920 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:41:46,921 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:41:46,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:41:46,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:41:46,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:41:46,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:41:46,923 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:41:46,924 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:41:46,924 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:41:46,924 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:41:46,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 14:41:46,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:41:46,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:41:46,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:41:46,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:41:46,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:41:46,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:41:46,925 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:41:46,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:41:46,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:41:46,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:41:46,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:41:46,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:41:46,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:41:46,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:41:46,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:41:46,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:41:46,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:41:46,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 14:41:46,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 14:41:46,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:41:46,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:41:46,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:41:46,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:41:46,928 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2024-11-13 14:41:47,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:41:47,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:41:47,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:41:47,318 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:41:47,318 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:41:47,320 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i Unable to find full path for "g++" [2024-11-13 14:41:49,321 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:41:49,668 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:41:49,669 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-13 14:41:49,684 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/data/aa7a30c24/eea37a2fc17147d681e1a388c9253a79/FLAG967a5caef [2024-11-13 14:41:49,891 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/data/aa7a30c24/eea37a2fc17147d681e1a388c9253a79 [2024-11-13 14:41:49,895 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:41:49,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:41:49,901 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:41:49,901 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:41:49,906 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:41:49,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:41:49" (1/1) ... [2024-11-13 14:41:49,909 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d84824a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:49, skipping insertion in model container [2024-11-13 14:41:49,909 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:41:49" (1/1) ... [2024-11-13 14:41:49,944 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:41:50,133 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-13 14:41:50,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:41:50,266 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:41:50,278 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-13 14:41:50,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:41:50,350 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:41:50,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50 WrapperNode [2024-11-13 14:41:50,351 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:41:50,352 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:41:50,353 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:41:50,353 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:41:50,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,385 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,473 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 219 [2024-11-13 14:41:50,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:41:50,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:41:50,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:41:50,475 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:41:50,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,548 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:41:50,549 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,549 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,577 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,589 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,596 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:41:50,619 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:41:50,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:41:50,621 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:41:50,622 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (1/1) ... [2024-11-13 14:41:50,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:41:50,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:41:50,668 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:41:50,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:41:50,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:41:50,702 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:41:50,703 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:41:50,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 14:41:50,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:41:50,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:41:50,824 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:41:50,827 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:41:51,535 INFO L? ?]: Removed 28 outVars from TransFormulas that were not future-live. [2024-11-13 14:41:51,536 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:41:51,551 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:41:51,552 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:41:51,552 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:51 BoogieIcfgContainer [2024-11-13 14:41:51,552 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:41:51,558 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:41:51,558 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:41:51,565 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:41:51,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:41:49" (1/3) ... [2024-11-13 14:41:51,566 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195e7581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:41:51, skipping insertion in model container [2024-11-13 14:41:51,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:41:50" (2/3) ... [2024-11-13 14:41:51,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@195e7581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:41:51, skipping insertion in model container [2024-11-13 14:41:51,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:51" (3/3) ... [2024-11-13 14:41:51,568 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-13 14:41:51,585 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:41:51,588 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-53.i that has 2 procedures, 96 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:41:51,649 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:41:51,663 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4340e1a2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:41:51,663 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:41:51,668 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 14:41:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:41:51,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:51,683 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:51,684 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:51,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:51,689 INFO L85 PathProgramCache]: Analyzing trace with hash -663178050, now seen corresponding path program 1 times [2024-11-13 14:41:51,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638062383] [2024-11-13 14:41:51,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:41:52,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:41:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:41:52,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:41:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:41:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:41:52,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:41:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:41:52,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:41:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:41:52,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:41:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:41:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:41:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:41:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:41:52,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:41:52,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:41:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:41:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:41:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:41:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:41:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:41:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:41:52,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:41:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:41:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:52,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:41:52,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:52,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638062383] [2024-11-13 14:41:52,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638062383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:52,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:52,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:41:52,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649953548] [2024-11-13 14:41:52,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:52,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:41:52,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:52,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:41:52,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:41:52,393 INFO L87 Difference]: Start difference. First operand has 96 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 69 states have internal predecessors, (99), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-13 14:41:52,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:52,439 INFO L93 Difference]: Finished difference Result 185 states and 317 transitions. [2024-11-13 14:41:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:41:52,441 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-13 14:41:52,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:52,451 INFO L225 Difference]: With dead ends: 185 [2024-11-13 14:41:52,451 INFO L226 Difference]: Without dead ends: 92 [2024-11-13 14:41:52,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:41:52,459 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:41:52,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:41:52,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-13 14:41:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2024-11-13 14:41:52,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 14:41:52,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions. [2024-11-13 14:41:52,517 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 170 [2024-11-13 14:41:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:52,517 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 142 transitions. [2024-11-13 14:41:52,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-13 14:41:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions. [2024-11-13 14:41:52,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:41:52,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:52,528 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:52,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 14:41:52,529 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:52,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:52,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1660668232, now seen corresponding path program 1 times [2024-11-13 14:41:52,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:52,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601565113] [2024-11-13 14:41:52,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:52,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:53,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:41:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:41:53,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:41:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:41:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:41:53,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:41:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:41:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:41:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:41:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:41:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:41:53,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:41:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:41:53,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:41:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:41:53,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:41:53,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:41:53,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:41:53,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:41:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:41:53,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:41:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:41:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:41:53,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:41:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:41:53,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:41:53,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:41:53,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:41:53,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601565113] [2024-11-13 14:41:53,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601565113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:41:53,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:41:53,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:41:53,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519823870] [2024-11-13 14:41:53,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:41:53,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:41:53,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:41:53,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:41:53,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:41:53,996 INFO L87 Difference]: Start difference. First operand 92 states and 142 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:41:54,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:41:54,137 INFO L93 Difference]: Finished difference Result 230 states and 353 transitions. [2024-11-13 14:41:54,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:41:54,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-13 14:41:54,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:41:54,143 INFO L225 Difference]: With dead ends: 230 [2024-11-13 14:41:54,143 INFO L226 Difference]: Without dead ends: 141 [2024-11-13 14:41:54,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:41:54,149 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 64 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:41:54,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 402 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:41:54,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-13 14:41:54,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-13 14:41:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.4368932038834952) internal successors, (148), 104 states have internal predecessors, (148), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-13 14:41:54,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 210 transitions. [2024-11-13 14:41:54,187 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 210 transitions. Word has length 170 [2024-11-13 14:41:54,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:41:54,189 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 210 transitions. [2024-11-13 14:41:54,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:41:54,189 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 210 transitions. [2024-11-13 14:41:54,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:41:54,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:41:54,196 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:41:54,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 14:41:54,196 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:41:54,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:41:54,197 INFO L85 PathProgramCache]: Analyzing trace with hash 114339130, now seen corresponding path program 1 times [2024-11-13 14:41:54,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:41:54,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587502021] [2024-11-13 14:41:54,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:41:54,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:41:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:05,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:05,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:05,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:05,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:05,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:05,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:05,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:42:05,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:05,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587502021] [2024-11-13 14:42:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587502021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:05,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:05,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-13 14:42:05,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432610400] [2024-11-13 14:42:05,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:05,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-13 14:42:05,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:05,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-13 14:42:05,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:42:05,575 INFO L87 Difference]: Start difference. First operand 137 states and 210 transitions. Second operand has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:11,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:11,755 INFO L93 Difference]: Finished difference Result 616 states and 938 transitions. [2024-11-13 14:42:11,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-13 14:42:11,756 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-13 14:42:11,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:11,765 INFO L225 Difference]: With dead ends: 616 [2024-11-13 14:42:11,766 INFO L226 Difference]: Without dead ends: 482 [2024-11-13 14:42:11,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=150, Invalid=552, Unknown=0, NotChecked=0, Total=702 [2024-11-13 14:42:11,768 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 743 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 1149 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 1149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:11,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 747 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 1149 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-13 14:42:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-13 14:42:11,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 215. [2024-11-13 14:42:11,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 154 states have (on average 1.4090909090909092) internal successors, (217), 155 states have internal predecessors, (217), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 14:42:11,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 329 transitions. [2024-11-13 14:42:11,831 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 329 transitions. Word has length 170 [2024-11-13 14:42:11,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:11,831 INFO L471 AbstractCegarLoop]: Abstraction has 215 states and 329 transitions. [2024-11-13 14:42:11,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.2) internal successors, (48), 15 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:11,832 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 329 transitions. [2024-11-13 14:42:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:42:11,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:11,834 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:11,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 14:42:11,834 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:11,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:11,835 INFO L85 PathProgramCache]: Analyzing trace with hash -143826308, now seen corresponding path program 1 times [2024-11-13 14:42:11,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:11,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750777567] [2024-11-13 14:42:11,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:11,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:12,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:17,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:17,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:17,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:17,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:17,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:17,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:18,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:18,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:18,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:18,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:42:18,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:18,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750777567] [2024-11-13 14:42:18,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750777567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:18,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:18,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-13 14:42:18,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162584645] [2024-11-13 14:42:18,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:18,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-13 14:42:18,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:18,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-13 14:42:18,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-13 14:42:18,098 INFO L87 Difference]: Start difference. First operand 215 states and 329 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-13 14:42:23,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:23,395 INFO L93 Difference]: Finished difference Result 606 states and 928 transitions. [2024-11-13 14:42:23,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-13 14:42:23,395 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 170 [2024-11-13 14:42:23,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:23,399 INFO L225 Difference]: With dead ends: 606 [2024-11-13 14:42:23,399 INFO L226 Difference]: Without dead ends: 472 [2024-11-13 14:42:23,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=138, Invalid=462, Unknown=0, NotChecked=0, Total=600 [2024-11-13 14:42:23,400 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 622 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 622 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 1268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:23,401 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [622 Valid, 864 Invalid, 1268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-13 14:42:23,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2024-11-13 14:42:23,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 240. [2024-11-13 14:42:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 179 states have (on average 1.441340782122905) internal successors, (258), 180 states have internal predecessors, (258), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 14:42:23,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 370 transitions. [2024-11-13 14:42:23,430 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 370 transitions. Word has length 170 [2024-11-13 14:42:23,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:23,431 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 370 transitions. [2024-11-13 14:42:23,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-13 14:42:23,431 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 370 transitions. [2024-11-13 14:42:23,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-13 14:42:23,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:23,433 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:23,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 14:42:23,433 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:23,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:23,434 INFO L85 PathProgramCache]: Analyzing trace with hash -896778120, now seen corresponding path program 1 times [2024-11-13 14:42:23,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:23,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128198536] [2024-11-13 14:42:23,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:25,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:25,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:25,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:25,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:25,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:25,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:25,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:25,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:25,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:25,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:25,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:25,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:25,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:42:25,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:25,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128198536] [2024-11-13 14:42:25,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128198536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:25,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:25,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:42:25,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000210899] [2024-11-13 14:42:25,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:25,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:42:25,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:25,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:42:25,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:42:25,894 INFO L87 Difference]: Start difference. First operand 240 states and 370 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:27,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:27,744 INFO L93 Difference]: Finished difference Result 555 states and 853 transitions. [2024-11-13 14:42:27,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:42:27,745 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 170 [2024-11-13 14:42:27,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:27,748 INFO L225 Difference]: With dead ends: 555 [2024-11-13 14:42:27,748 INFO L226 Difference]: Without dead ends: 421 [2024-11-13 14:42:27,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-13 14:42:27,749 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 447 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:27,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 566 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 14:42:27,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-13 14:42:27,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 240. [2024-11-13 14:42:27,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 179 states have (on average 1.441340782122905) internal successors, (258), 180 states have internal predecessors, (258), 56 states have call successors, (56), 4 states have call predecessors, (56), 4 states have return successors, (56), 55 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-13 14:42:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 370 transitions. [2024-11-13 14:42:27,794 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 370 transitions. Word has length 170 [2024-11-13 14:42:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:27,794 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 370 transitions. [2024-11-13 14:42:27,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 370 transitions. [2024-11-13 14:42:27,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 14:42:27,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:27,797 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:27,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 14:42:27,797 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:27,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:27,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1358074627, now seen corresponding path program 1 times [2024-11-13 14:42:27,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:27,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603424738] [2024-11-13 14:42:27,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:27,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:27,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:27,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:27,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:27,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:27,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:27,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:27,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:27,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:27,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:27,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:28,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:28,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:28,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:28,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:28,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:28,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,022 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:42:28,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603424738] [2024-11-13 14:42:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603424738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:28,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:28,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:42:28,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094666285] [2024-11-13 14:42:28,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:28,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:42:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:28,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:42:28,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:42:28,024 INFO L87 Difference]: Start difference. First operand 240 states and 370 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:28,195 INFO L93 Difference]: Finished difference Result 568 states and 875 transitions. [2024-11-13 14:42:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-13 14:42:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-13 14:42:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:28,199 INFO L225 Difference]: With dead ends: 568 [2024-11-13 14:42:28,199 INFO L226 Difference]: Without dead ends: 434 [2024-11-13 14:42:28,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-13 14:42:28,201 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 139 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:28,201 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 415 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:42:28,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-13 14:42:28,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 353. [2024-11-13 14:42:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 281 states have (on average 1.4483985765124556) internal successors, (407), 284 states have internal predecessors, (407), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:42:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 535 transitions. [2024-11-13 14:42:28,255 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 535 transitions. Word has length 171 [2024-11-13 14:42:28,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:28,256 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 535 transitions. [2024-11-13 14:42:28,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:28,256 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 535 transitions. [2024-11-13 14:42:28,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 14:42:28,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:28,260 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:28,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 14:42:28,260 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:28,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:28,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1492088133, now seen corresponding path program 1 times [2024-11-13 14:42:28,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:28,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738935062] [2024-11-13 14:42:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:28,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:28,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:28,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:28,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:28,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:28,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:28,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:28,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:28,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:28,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:28,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:28,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:28,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:42:28,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:28,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738935062] [2024-11-13 14:42:28,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738935062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:28,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:28,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:42:28,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819978435] [2024-11-13 14:42:28,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:28,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:42:28,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:28,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:42:28,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:42:28,966 INFO L87 Difference]: Start difference. First operand 353 states and 535 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:29,653 INFO L93 Difference]: Finished difference Result 1032 states and 1556 transitions. [2024-11-13 14:42:29,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:42:29,653 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-13 14:42:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:29,658 INFO L225 Difference]: With dead ends: 1032 [2024-11-13 14:42:29,658 INFO L226 Difference]: Without dead ends: 821 [2024-11-13 14:42:29,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:42:29,660 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 330 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:29,660 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1131 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-13 14:42:29,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 821 states. [2024-11-13 14:42:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 821 to 401. [2024-11-13 14:42:29,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 329 states have (on average 1.4711246200607904) internal successors, (484), 332 states have internal predecessors, (484), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:42:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 612 transitions. [2024-11-13 14:42:29,724 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 612 transitions. Word has length 171 [2024-11-13 14:42:29,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:29,726 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 612 transitions. [2024-11-13 14:42:29,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:29,726 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 612 transitions. [2024-11-13 14:42:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 14:42:29,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:29,731 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:29,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 14:42:29,731 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:29,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:29,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1233922695, now seen corresponding path program 1 times [2024-11-13 14:42:29,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:29,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025051026] [2024-11-13 14:42:29,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:29,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:29,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:32,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:32,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:32,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:32,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:32,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:32,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:32,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:32,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:42:32,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:32,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025051026] [2024-11-13 14:42:32,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025051026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:32,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:32,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 14:42:32,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145405953] [2024-11-13 14:42:32,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:32,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:42:32,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:32,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:42:32,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:42:32,065 INFO L87 Difference]: Start difference. First operand 401 states and 612 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:33,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:33,645 INFO L93 Difference]: Finished difference Result 986 states and 1498 transitions. [2024-11-13 14:42:33,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 14:42:33,646 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-13 14:42:33,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:33,650 INFO L225 Difference]: With dead ends: 986 [2024-11-13 14:42:33,651 INFO L226 Difference]: Without dead ends: 775 [2024-11-13 14:42:33,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:42:33,652 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 251 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:33,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 581 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 14:42:33,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2024-11-13 14:42:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 441. [2024-11-13 14:42:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 369 states have (on average 1.4878048780487805) internal successors, (549), 372 states have internal predecessors, (549), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:42:33,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 677 transitions. [2024-11-13 14:42:33,686 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 677 transitions. Word has length 171 [2024-11-13 14:42:33,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:33,687 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 677 transitions. [2024-11-13 14:42:33,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:33,687 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 677 transitions. [2024-11-13 14:42:33,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 14:42:33,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:33,690 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:33,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 14:42:33,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:33,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:33,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1934045580, now seen corresponding path program 1 times [2024-11-13 14:42:33,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:33,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579852008] [2024-11-13 14:42:33,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:33,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:33,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:39,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:39,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:39,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:39,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:39,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:39,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:39,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:39,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:39,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:40,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:40,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:40,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:40,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:40,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:40,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:40,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:40,272 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:42:40,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:40,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579852008] [2024-11-13 14:42:40,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579852008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:40,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:40,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-13 14:42:40,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173005090] [2024-11-13 14:42:40,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:40,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 14:42:40,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:40,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 14:42:40,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2024-11-13 14:42:40,276 INFO L87 Difference]: Start difference. First operand 441 states and 677 transitions. Second operand has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-13 14:42:46,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:46,222 INFO L93 Difference]: Finished difference Result 1439 states and 2189 transitions. [2024-11-13 14:42:46,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 14:42:46,223 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 171 [2024-11-13 14:42:46,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:46,228 INFO L225 Difference]: With dead ends: 1439 [2024-11-13 14:42:46,228 INFO L226 Difference]: Without dead ends: 1182 [2024-11-13 14:42:46,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=224, Invalid=768, Unknown=0, NotChecked=0, Total=992 [2024-11-13 14:42:46,230 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1200 mSDsluCounter, 828 mSDsCounter, 0 mSdLazyCounter, 1460 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1200 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:46,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1200 Valid, 981 Invalid, 1570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1460 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-13 14:42:46,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2024-11-13 14:42:46,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 458. [2024-11-13 14:42:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 386 states have (on average 1.494818652849741) internal successors, (577), 389 states have internal predecessors, (577), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:42:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 705 transitions. [2024-11-13 14:42:46,269 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 705 transitions. Word has length 171 [2024-11-13 14:42:46,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:46,270 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 705 transitions. [2024-11-13 14:42:46,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.8823529411764706) internal successors, (49), 17 states have internal predecessors, (49), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-13 14:42:46,270 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 705 transitions. [2024-11-13 14:42:46,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-13 14:42:46,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:46,273 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:46,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 14:42:46,274 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:46,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:46,274 INFO L85 PathProgramCache]: Analyzing trace with hash 2102756278, now seen corresponding path program 1 times [2024-11-13 14:42:46,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:46,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023635324] [2024-11-13 14:42:46,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:46,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:46,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:48,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:48,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:48,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:48,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:48,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:48,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:48,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:48,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:48,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:48,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:48,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:42:48,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:48,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023635324] [2024-11-13 14:42:48,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023635324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:42:48,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:42:48,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-13 14:42:48,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158840162] [2024-11-13 14:42:48,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:42:48,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 14:42:48,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:48,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 14:42:48,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-13 14:42:48,976 INFO L87 Difference]: Start difference. First operand 458 states and 705 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:51,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:51,064 INFO L93 Difference]: Finished difference Result 1164 states and 1781 transitions. [2024-11-13 14:42:51,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:42:51,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 171 [2024-11-13 14:42:51,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:51,069 INFO L225 Difference]: With dead ends: 1164 [2024-11-13 14:42:51,069 INFO L226 Difference]: Without dead ends: 907 [2024-11-13 14:42:51,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-13 14:42:51,071 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 269 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:51,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 612 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-13 14:42:51,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 907 states. [2024-11-13 14:42:51,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 907 to 443. [2024-11-13 14:42:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 371 states have (on average 1.4878706199460916) internal successors, (552), 374 states have internal predecessors, (552), 64 states have call successors, (64), 7 states have call predecessors, (64), 7 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:42:51,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 680 transitions. [2024-11-13 14:42:51,107 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 680 transitions. Word has length 171 [2024-11-13 14:42:51,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:51,107 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 680 transitions. [2024-11-13 14:42:51,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:42:51,108 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 680 transitions. [2024-11-13 14:42:51,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 14:42:51,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:51,110 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:51,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 14:42:51,110 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:51,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:51,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1385875477, now seen corresponding path program 1 times [2024-11-13 14:42:51,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:51,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433795477] [2024-11-13 14:42:51,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:51,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:51,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:52,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:52,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:52,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:52,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:52,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:52,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:52,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:52,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:52,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:52,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:52,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:52,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-13 14:42:52,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:52,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433795477] [2024-11-13 14:42:52,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433795477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:42:52,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957007092] [2024-11-13 14:42:52,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:52,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:52,390 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:42:52,393 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:42:52,395 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 14:42:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:52,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:42:52,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:52,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 78 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-13 14:42:52,979 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:42:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-13 14:42:53,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957007092] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:42:53,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:42:53,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 6] total 21 [2024-11-13 14:42:53,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030164218] [2024-11-13 14:42:53,370 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:42:53,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-13 14:42:53,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:42:53,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-13 14:42:53,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=362, Unknown=0, NotChecked=0, Total=420 [2024-11-13 14:42:53,373 INFO L87 Difference]: Start difference. First operand 443 states and 680 transitions. Second operand has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-13 14:42:57,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:42:57,428 INFO L93 Difference]: Finished difference Result 2256 states and 3315 transitions. [2024-11-13 14:42:57,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2024-11-13 14:42:57,428 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) Word has length 172 [2024-11-13 14:42:57,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:42:57,435 INFO L225 Difference]: With dead ends: 2256 [2024-11-13 14:42:57,436 INFO L226 Difference]: Without dead ends: 1919 [2024-11-13 14:42:57,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 475 GetRequests, 389 SyntacticMatches, 2 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2243 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1056, Invalid=6254, Unknown=0, NotChecked=0, Total=7310 [2024-11-13 14:42:57,440 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 1556 mSDsluCounter, 1370 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1568 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 2198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-13 14:42:57,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1568 Valid, 1533 Invalid, 2198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-13 14:42:57,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1919 states. [2024-11-13 14:42:57,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1919 to 606. [2024-11-13 14:42:57,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 606 states, 529 states have (on average 1.440453686200378) internal successors, (762), 532 states have internal predecessors, (762), 64 states have call successors, (64), 12 states have call predecessors, (64), 12 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:42:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 890 transitions. [2024-11-13 14:42:57,510 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 890 transitions. Word has length 172 [2024-11-13 14:42:57,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:42:57,511 INFO L471 AbstractCegarLoop]: Abstraction has 606 states and 890 transitions. [2024-11-13 14:42:57,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.0476190476190474) internal successors, (127), 21 states have internal predecessors, (127), 5 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (65), 5 states have call predecessors, (65), 5 states have call successors, (65) [2024-11-13 14:42:57,512 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 890 transitions. [2024-11-13 14:42:57,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 14:42:57,514 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:42:57,514 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:42:57,535 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 14:42:57,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-13 14:42:57,715 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:42:57,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:42:57,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1897974569, now seen corresponding path program 1 times [2024-11-13 14:42:57,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:42:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689808138] [2024-11-13 14:42:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:42:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:42:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:42:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:42:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:42:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:42:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:42:58,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:42:58,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:42:58,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:42:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:42:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:42:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:42:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:42:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:42:58,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:42:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:42:58,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:42:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:42:58,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:42:58,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:42:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:42:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:42:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:42:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:42:58,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:42:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-13 14:42:58,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:42:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689808138] [2024-11-13 14:42:58,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689808138] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:42:58,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056451635] [2024-11-13 14:42:58,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:42:58,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:42:58,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:42:58,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:42:58,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 14:42:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:42:58,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 14:42:58,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:42:59,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 204 proven. 66 refuted. 0 times theorem prover too weak. 930 trivial. 0 not checked. [2024-11-13 14:42:59,364 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:43:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-13 14:43:00,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056451635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:43:00,062 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 14:43:00,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 22 [2024-11-13 14:43:00,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479821901] [2024-11-13 14:43:00,063 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 14:43:00,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-13 14:43:00,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:00,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-13 14:43:00,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2024-11-13 14:43:00,065 INFO L87 Difference]: Start difference. First operand 606 states and 890 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-11-13 14:43:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:43:01,787 INFO L93 Difference]: Finished difference Result 1364 states and 1972 transitions. [2024-11-13 14:43:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2024-11-13 14:43:01,787 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) Word has length 172 [2024-11-13 14:43:01,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:43:01,791 INFO L225 Difference]: With dead ends: 1364 [2024-11-13 14:43:01,791 INFO L226 Difference]: Without dead ends: 977 [2024-11-13 14:43:01,792 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=473, Invalid=1879, Unknown=0, NotChecked=0, Total=2352 [2024-11-13 14:43:01,793 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 877 mSDsluCounter, 1079 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:43:01,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1181 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-13 14:43:01,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2024-11-13 14:43:01,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 571. [2024-11-13 14:43:01,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 493 states have (on average 1.4198782961460445) internal successors, (700), 496 states have internal predecessors, (700), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:43:01,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 828 transitions. [2024-11-13 14:43:01,849 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 828 transitions. Word has length 172 [2024-11-13 14:43:01,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:43:01,849 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 828 transitions. [2024-11-13 14:43:01,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 22 states have internal predecessors, (120), 6 states have call successors, (75), 3 states have call predecessors, (75), 6 states have return successors, (75), 6 states have call predecessors, (75), 6 states have call successors, (75) [2024-11-13 14:43:01,850 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2024-11-13 14:43:01,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 14:43:01,852 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:43:01,852 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:01,876 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 14:43:02,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-13 14:43:02,053 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:43:02,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:02,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1161066647, now seen corresponding path program 1 times [2024-11-13 14:43:02,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:02,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049188344] [2024-11-13 14:43:02,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:02,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:43:02,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:43:02,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:43:02,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:43:02,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:43:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:43:02,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:43:02,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:43:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:43:02,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:43:02,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:43:02,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:43:02,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:43:02,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:43:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:43:02,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:43:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:43:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:43:02,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:43:02,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:43:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:43:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:43:02,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:43:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:43:02,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:43:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:02,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:43:02,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:02,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049188344] [2024-11-13 14:43:02,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049188344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:02,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:02,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:43:02,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671327542] [2024-11-13 14:43:02,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:02,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:43:02,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:02,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:43:02,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:43:02,296 INFO L87 Difference]: Start difference. First operand 571 states and 828 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:43:02,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:43:02,435 INFO L93 Difference]: Finished difference Result 982 states and 1429 transitions. [2024-11-13 14:43:02,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:43:02,436 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2024-11-13 14:43:02,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:43:02,438 INFO L225 Difference]: With dead ends: 982 [2024-11-13 14:43:02,438 INFO L226 Difference]: Without dead ends: 585 [2024-11-13 14:43:02,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:43:02,440 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 59 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:43:02,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 289 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:43:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-13 14:43:02,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 579. [2024-11-13 14:43:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 579 states, 501 states have (on average 1.4131736526946108) internal successors, (708), 504 states have internal predecessors, (708), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:43:02,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 836 transitions. [2024-11-13 14:43:02,501 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 836 transitions. Word has length 172 [2024-11-13 14:43:02,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:43:02,502 INFO L471 AbstractCegarLoop]: Abstraction has 579 states and 836 transitions. [2024-11-13 14:43:02,502 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:43:02,502 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 836 transitions. [2024-11-13 14:43:02,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-13 14:43:02,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:43:02,504 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:02,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-13 14:43:02,505 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:43:02,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:02,505 INFO L85 PathProgramCache]: Analyzing trace with hash -2136461171, now seen corresponding path program 1 times [2024-11-13 14:43:02,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:02,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356603574] [2024-11-13 14:43:02,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:02,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:43:04,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:43:04,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:43:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:43:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:43:04,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:43:04,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:43:04,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:43:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:43:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:43:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:43:04,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:43:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:43:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:43:04,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:43:04,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:43:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:43:04,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:43:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:43:04,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:43:04,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:43:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:43:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:43:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:43:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:43:04,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:04,543 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:43:04,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356603574] [2024-11-13 14:43:04,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356603574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:04,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:04,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 14:43:04,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172257140] [2024-11-13 14:43:04,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:04,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-13 14:43:04,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:04,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-13 14:43:04,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-13 14:43:04,544 INFO L87 Difference]: Start difference. First operand 579 states and 836 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:43:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:43:06,139 INFO L93 Difference]: Finished difference Result 1442 states and 2092 transitions. [2024-11-13 14:43:06,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 14:43:06,140 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 172 [2024-11-13 14:43:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:43:06,144 INFO L225 Difference]: With dead ends: 1442 [2024-11-13 14:43:06,144 INFO L226 Difference]: Without dead ends: 1089 [2024-11-13 14:43:06,145 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:43:06,145 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 225 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-13 14:43:06,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 604 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-13 14:43:06,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2024-11-13 14:43:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 577. [2024-11-13 14:43:06,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 577 states, 499 states have (on average 1.4128256513026052) internal successors, (705), 502 states have internal predecessors, (705), 64 states have call successors, (64), 13 states have call predecessors, (64), 13 states have return successors, (64), 61 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 14:43:06,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 833 transitions. [2024-11-13 14:43:06,210 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 833 transitions. Word has length 172 [2024-11-13 14:43:06,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:43:06,210 INFO L471 AbstractCegarLoop]: Abstraction has 577 states and 833 transitions. [2024-11-13 14:43:06,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:43:06,210 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 833 transitions. [2024-11-13 14:43:06,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 14:43:06,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:43:06,212 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:06,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 14:43:06,212 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:43:06,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash -60259638, now seen corresponding path program 1 times [2024-11-13 14:43:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022058583] [2024-11-13 14:43:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 14:43:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 14:43:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 14:43:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 14:43:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-13 14:43:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 14:43:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-13 14:43:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 14:43:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-13 14:43:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 14:43:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 14:43:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-13 14:43:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 14:43:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-13 14:43:06,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 14:43:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 14:43:06,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-13 14:43:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-13 14:43:06,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-13 14:43:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-13 14:43:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-13 14:43:06,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-13 14:43:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-13 14:43:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-13 14:43:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-13 14:43:06,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:06,395 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:43:06,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:06,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022058583] [2024-11-13 14:43:06,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022058583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:06,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:06,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-13 14:43:06,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780506163] [2024-11-13 14:43:06,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:06,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:43:06,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:06,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:43:06,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:43:06,398 INFO L87 Difference]: Start difference. First operand 577 states and 833 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:43:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:43:06,621 INFO L93 Difference]: Finished difference Result 1423 states and 2068 transitions. [2024-11-13 14:43:06,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:43:06,622 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 173 [2024-11-13 14:43:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:43:06,626 INFO L225 Difference]: With dead ends: 1423 [2024-11-13 14:43:06,626 INFO L226 Difference]: Without dead ends: 1012 [2024-11-13 14:43:06,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 14:43:06,628 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 133 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:43:06,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 368 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 14:43:06,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2024-11-13 14:43:06,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 1007. [2024-11-13 14:43:06,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1007 states, 884 states have (on average 1.4038461538461537) internal successors, (1241), 890 states have internal predecessors, (1241), 103 states have call successors, (103), 19 states have call predecessors, (103), 19 states have return successors, (103), 97 states have call predecessors, (103), 103 states have call successors, (103) [2024-11-13 14:43:06,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1007 states to 1007 states and 1447 transitions. [2024-11-13 14:43:06,735 INFO L78 Accepts]: Start accepts. Automaton has 1007 states and 1447 transitions. Word has length 173 [2024-11-13 14:43:06,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:43:06,735 INFO L471 AbstractCegarLoop]: Abstraction has 1007 states and 1447 transitions. [2024-11-13 14:43:06,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:43:06,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1007 states and 1447 transitions. [2024-11-13 14:43:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 14:43:06,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:43:06,738 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:06,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 14:43:06,738 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:43:06,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -731109854, now seen corresponding path program 1 times [2024-11-13 14:43:06,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:06,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208516862] [2024-11-13 14:43:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:06,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:07,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:43:07,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1097985081] [2024-11-13 14:43:07,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:07,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:07,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:07,199 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:07,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 14:43:07,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:07,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-13 14:43:07,408 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:09,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 602 proven. 159 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-13 14:43:09,867 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:43:13,810 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 96 proven. 111 refuted. 0 times theorem prover too weak. 993 trivial. 0 not checked. [2024-11-13 14:43:13,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 14:43:13,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208516862] [2024-11-13 14:43:13,811 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 14:43:13,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097985081] [2024-11-13 14:43:13,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097985081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:43:13,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:43:13,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 38 [2024-11-13 14:43:13,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179436217] [2024-11-13 14:43:13,812 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:43:13,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-13 14:43:13,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 14:43:13,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-13 14:43:13,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1113, Unknown=0, NotChecked=0, Total=1406 [2024-11-13 14:43:13,814 INFO L87 Difference]: Start difference. First operand 1007 states and 1447 transitions. Second operand has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 36 states have internal predecessors, (120), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-13 14:43:32,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:43:32,368 INFO L93 Difference]: Finished difference Result 4589 states and 6359 transitions. [2024-11-13 14:43:32,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2024-11-13 14:43:32,369 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 36 states have internal predecessors, (120), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) Word has length 173 [2024-11-13 14:43:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:43:32,382 INFO L225 Difference]: With dead ends: 4589 [2024-11-13 14:43:32,382 INFO L226 Difference]: Without dead ends: 3780 [2024-11-13 14:43:32,387 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4967 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=3320, Invalid=12682, Unknown=0, NotChecked=0, Total=16002 [2024-11-13 14:43:32,388 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 2331 mSDsluCounter, 2037 mSDsCounter, 0 mSdLazyCounter, 4302 mSolverCounterSat, 271 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2349 SdHoareTripleChecker+Valid, 2211 SdHoareTripleChecker+Invalid, 4573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 271 IncrementalHoareTripleChecker+Valid, 4302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:43:32,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2349 Valid, 2211 Invalid, 4573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [271 Valid, 4302 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2024-11-13 14:43:32,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3780 states. [2024-11-13 14:43:32,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3780 to 1691. [2024-11-13 14:43:32,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1691 states, 1473 states have (on average 1.3754243041412084) internal successors, (2026), 1483 states have internal predecessors, (2026), 162 states have call successors, (162), 55 states have call predecessors, (162), 55 states have return successors, (162), 152 states have call predecessors, (162), 162 states have call successors, (162) [2024-11-13 14:43:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1691 states to 1691 states and 2350 transitions. [2024-11-13 14:43:32,683 INFO L78 Accepts]: Start accepts. Automaton has 1691 states and 2350 transitions. Word has length 173 [2024-11-13 14:43:32,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:43:32,683 INFO L471 AbstractCegarLoop]: Abstraction has 1691 states and 2350 transitions. [2024-11-13 14:43:32,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 3.2432432432432434) internal successors, (120), 36 states have internal predecessors, (120), 10 states have call successors, (50), 6 states have call predecessors, (50), 11 states have return successors, (50), 8 states have call predecessors, (50), 10 states have call successors, (50) [2024-11-13 14:43:32,684 INFO L276 IsEmpty]: Start isEmpty. Operand 1691 states and 2350 transitions. [2024-11-13 14:43:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-13 14:43:32,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:43:32,686 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:32,707 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 14:43:32,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 14:43:32,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:43:32,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash -263042784, now seen corresponding path program 1 times [2024-11-13 14:43:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 14:43:32,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315426923] [2024-11-13 14:43:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 14:43:33,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 14:43:33,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [677949903] [2024-11-13 14:43:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:33,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:43:33,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:33,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:43:33,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:43:33,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:43:33,570 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 14:43:33,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 14:43:33,761 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 14:43:33,761 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 14:43:33,762 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 14:43:33,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:43:33,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 14:43:33,966 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:34,125 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 14:43:34,130 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 02:43:34 BoogieIcfgContainer [2024-11-13 14:43:34,130 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 14:43:34,131 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 14:43:34,131 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 14:43:34,131 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 14:43:34,136 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:41:51" (3/4) ... [2024-11-13 14:43:34,137 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 14:43:34,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 14:43:34,138 INFO L158 Benchmark]: Toolchain (without parser) took 104240.79ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 118.6MB in the beginning and 149.9MB in the end (delta: -31.4MB). Peak memory consumption was 144.2MB. Max. memory is 16.1GB. [2024-11-13 14:43:34,139 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:34,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 450.06ms. Allocated memory is still 142.6MB. Free memory was 118.6MB in the beginning and 100.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 14:43:34,140 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.00ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 92.9MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:43:34,140 INFO L158 Benchmark]: Boogie Preprocessor took 144.47ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 77.2MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-13 14:43:34,140 INFO L158 Benchmark]: RCFGBuilder took 932.96ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 88.0MB in the end (delta: -10.8MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2024-11-13 14:43:34,141 INFO L158 Benchmark]: TraceAbstraction took 102572.64ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 87.4MB in the beginning and 150.0MB in the end (delta: -62.6MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. [2024-11-13 14:43:34,141 INFO L158 Benchmark]: Witness Printer took 6.93ms. Allocated memory is still 318.8MB. Free memory was 150.0MB in the beginning and 149.9MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 14:43:34,145 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.46ms. Allocated memory is still 142.6MB. Free memory is still 80.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 450.06ms. Allocated memory is still 142.6MB. Free memory was 118.6MB in the beginning and 100.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.00ms. Allocated memory is still 142.6MB. Free memory was 100.7MB in the beginning and 92.9MB in the end (delta: 7.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 144.47ms. Allocated memory is still 142.6MB. Free memory was 92.9MB in the beginning and 77.2MB in the end (delta: 15.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 932.96ms. Allocated memory is still 142.6MB. Free memory was 77.2MB in the beginning and 88.0MB in the end (delta: -10.8MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * TraceAbstraction took 102572.64ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 87.4MB in the beginning and 150.0MB in the end (delta: -62.6MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. * Witness Printer took 6.93ms. Allocated memory is still 318.8MB. Free memory was 150.0MB in the beginning and 149.9MB in the end (delta: 41.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 193, overapproximation of someBinaryFLOATComparisonOperation at line 167, overapproximation of someBinaryFLOATComparisonOperation at line 165, overapproximation of someUnaryDOUBLEoperation at line 38, overapproximation of someBinaryDOUBLEComparisonOperation at line 175, overapproximation of someBinaryDOUBLEComparisonOperation at line 193, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 97, overapproximation of someBinaryArithmeticFLOAToperation at line 91. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -100; [L23] unsigned char var_1_2 = 200; [L24] unsigned char var_1_3 = 100; [L25] unsigned char var_1_4 = 8; [L26] unsigned char var_1_7 = 16; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_12 = 0; [L29] unsigned char var_1_13 = 0; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 1; [L32] unsigned char var_1_16 = 0; [L33] unsigned short int var_1_17 = 256; [L34] signed short int var_1_19 = -100; [L35] signed short int var_1_20 = 32; [L36] unsigned char var_1_21 = 1; [L37] signed short int var_1_23 = -256; [L38] float var_1_24 = -0.5; [L39] float var_1_25 = 255.8; [L40] float var_1_26 = 31.2; [L41] float var_1_27 = 0.5; [L42] unsigned char var_1_28 = 32; [L43] unsigned char var_1_29 = 64; [L44] unsigned short int var_1_30 = 16; [L45] double var_1_31 = 255.9; [L46] unsigned short int var_1_33 = 39141; [L47] unsigned short int var_1_34 = 52589; [L48] signed long int last_1_var_1_1 = -100; [L49] unsigned char last_1_var_1_7 = 16; [L50] unsigned short int last_1_var_1_17 = 256; [L51] signed short int last_1_var_1_19 = -100; [L52] signed short int last_1_var_1_20 = 32; [L53] signed short int last_1_var_1_23 = -256; [L54] unsigned char last_1_var_1_28 = 32; VAL [isInitial=0, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L197] isInitial = 1 [L198] FCALL initially() [L199] COND TRUE 1 [L200] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_7 = var_1_7 [L186] last_1_var_1_17 = var_1_17 [L187] last_1_var_1_19 = var_1_19 [L188] last_1_var_1_20 = var_1_20 [L189] last_1_var_1_23 = var_1_23 [L190] last_1_var_1_28 = var_1_28 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=200, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L200] RET updateLastVariables() [L201] CALL updateVariables() [L143] var_1_2 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_2 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L144] RET assume_abort_if_not(var_1_2 >= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_2 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L145] RET assume_abort_if_not(var_1_2 <= 255) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=100, var_1_4=8, var_1_7=16, var_1_9=0] [L146] var_1_3 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_3 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L147] RET assume_abort_if_not(var_1_3 >= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_3 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L148] RET assume_abort_if_not(var_1_3 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=8, var_1_7=16, var_1_9=0] [L149] var_1_4 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L150] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_7=16, var_1_9=0] [L151] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L151] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L152] var_1_12 = __VERIFIER_nondet_uchar() [L153] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_12 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L154] RET assume_abort_if_not(var_1_12 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L155] var_1_13 = __VERIFIER_nondet_uchar() [L156] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L157] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L158] var_1_15 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_15 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L159] RET assume_abort_if_not(var_1_15 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L160] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=0, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L161] var_1_16 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L162] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] CALL assume_abort_if_not(var_1_16 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L163] RET assume_abort_if_not(var_1_16 <= 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_25=1279/5, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L164] var_1_25 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L165] RET assume_abort_if_not((var_1_25 >= -461168.6018427382800e+13F && var_1_25 <= -1.0e-20F) || (var_1_25 <= 4611686.018427382800e+12F && var_1_25 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_26=156/5, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L166] var_1_26 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L167] RET assume_abort_if_not((var_1_26 >= -461168.6018427382800e+13F && var_1_26 <= -1.0e-20F) || (var_1_26 <= 4611686.018427382800e+12F && var_1_26 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_27=1/2, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L168] var_1_27 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L169] RET assume_abort_if_not((var_1_27 >= -461168.6018427382800e+13F && var_1_27 <= -1.0e-20F) || (var_1_27 <= 4611686.018427382800e+12F && var_1_27 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=64, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L170] var_1_29 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_29 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L171] RET assume_abort_if_not(var_1_29 >= 64) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_29 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L172] RET assume_abort_if_not(var_1_29 <= 127) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_31=2559/10, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L173] var_1_31 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L174] RET assume_abort_if_not((var_1_31 >= -922337.2036854776000e+13F && var_1_31 <= -1.0e-20F) || (var_1_31 <= 9223372.036854776000e+12F && var_1_31 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_31 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L175] RET assume_abort_if_not(var_1_31 != 0.0F) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=39141, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L176] var_1_33 = __VERIFIER_nondet_ushort() [L177] CALL assume_abort_if_not(var_1_33 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L177] RET assume_abort_if_not(var_1_33 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_33 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L178] RET assume_abort_if_not(var_1_33 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=52589, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L179] var_1_34 = __VERIFIER_nondet_ushort() [L180] CALL assume_abort_if_not(var_1_34 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L180] RET assume_abort_if_not(var_1_34 >= 32767) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_34 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L181] RET assume_abort_if_not(var_1_34 <= 65534) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=-100, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L201] RET updateVariables() [L202] CALL step() [L58] COND FALSE !((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) [L67] var_1_1 = var_1_2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L69] unsigned char stepLocal_1 = last_1_var_1_28 < (var_1_3 - var_1_4); [L70] signed long int stepLocal_0 = last_1_var_1_28; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, stepLocal_1=1, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L71] COND TRUE stepLocal_1 || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1)) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_0=32, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=16, var_1_9=0] [L72] COND TRUE stepLocal_0 >= var_1_4 [L73] var_1_7 = 2 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L80] unsigned char stepLocal_3 = var_1_4; [L81] signed long int stepLocal_2 = last_1_var_1_17; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_2=256, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=0, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L82] COND FALSE !(stepLocal_2 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) [L89] var_1_14 = var_1_15 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L91] var_1_24 = (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27)))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=32, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L92] COND TRUE ! var_1_12 [L93] var_1_28 = ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=16, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L97] COND TRUE (var_1_24 / var_1_31) > var_1_24 [L98] var_1_30 = (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=-100, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L100] var_1_19 = ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L101] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L101] COND FALSE !(var_1_1 != (var_1_4 ^ var_1_1)) [L110] unsigned char stepLocal_6 = var_1_9; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_6=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=32, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L111] COND TRUE stepLocal_6 || (var_1_28 >= last_1_var_1_20) [L112] var_1_20 = (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L116] unsigned char stepLocal_8 = var_1_28 > var_1_7; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_8=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=-256, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L117] COND TRUE stepLocal_8 || var_1_14 [L118] var_1_23 = (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L122] unsigned char stepLocal_7 = ((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_7=1, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L123] COND FALSE !(stepLocal_7 && var_1_13) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L128] signed short int stepLocal_5 = var_1_23; [L129] unsigned char stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, stepLocal_5=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L130] COND FALSE !((var_1_28 / (2571661009u - var_1_2)) != stepLocal_5) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=256, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L135] COND TRUE \read(var_1_21) [L136] var_1_17 = var_1_7 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, stepLocal_3=0, stepLocal_4=0, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L202] RET step() [L203] CALL, EXPR property() [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR var_1_4 ^ var_1_1 VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193] EXPR ((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L193-L194] return (((((((((((((var_1_2 - (var_1_3 - var_1_4)) == last_1_var_1_7) ? (((var_1_3 + last_1_var_1_7) >= (var_1_4 / var_1_2)) ? ((last_1_var_1_7 > var_1_4) ? (var_1_1 == ((signed long int) (var_1_4 + last_1_var_1_20))) : (var_1_1 == ((signed long int) var_1_2))) : 1) : (var_1_1 == ((signed long int) var_1_2))) && (((last_1_var_1_28 < (var_1_3 - var_1_4)) || (last_1_var_1_23 > (last_1_var_1_19 * last_1_var_1_1))) ? ((last_1_var_1_28 >= var_1_4) ? (var_1_7 == ((unsigned char) 2)) : (var_1_7 == ((unsigned char) var_1_4))) : (var_1_7 == ((unsigned char) var_1_3)))) && ((var_1_1 != (var_1_4 ^ var_1_1)) ? (var_1_14 ? (var_1_14 ? (var_1_9 == ((unsigned char) (var_1_12 || (! (! var_1_13))))) : 1) : (var_1_9 == ((unsigned char) var_1_13))) : 1)) && ((last_1_var_1_17 < ((((var_1_2) > (var_1_4)) ? (var_1_2) : (var_1_4)))) ? ((var_1_4 >= last_1_var_1_19) ? (var_1_14 == ((unsigned char) var_1_12)) : (var_1_14 == ((unsigned char) (var_1_15 && var_1_16)))) : (var_1_14 == ((unsigned char) var_1_15)))) && (((var_1_28 / (2571661009u - var_1_2)) != var_1_23) ? ((var_1_12 && var_1_21) ? (var_1_17 == ((unsigned short int) 2)) : 1) : (var_1_21 ? (var_1_17 == ((unsigned short int) var_1_7)) : (var_1_17 == ((unsigned short int) var_1_2))))) && (var_1_19 == ((signed short int) ((((((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < (var_1_28)) ? (((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) : (var_1_28)))))) && ((var_1_9 || (var_1_28 >= last_1_var_1_20)) ? (var_1_20 == ((signed short int) (((((var_1_2) > (var_1_3)) ? (var_1_2) : (var_1_3))) + var_1_4))) : (var_1_20 == ((signed short int) (var_1_4 - (((((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) < 0 ) ? -((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3))) : ((((last_1_var_1_20) > (var_1_3)) ? (last_1_var_1_20) : (var_1_3)))))))))) && (((((((var_1_23) > (var_1_19)) ? (var_1_23) : (var_1_19))) <= 0) && var_1_13) ? (var_1_14 ? (var_1_21 == ((unsigned char) var_1_16)) : 1) : 1)) && (((var_1_28 > var_1_7) || var_1_14) ? (var_1_23 == ((signed short int) (((((var_1_3 + (var_1_2 - var_1_28))) < (var_1_4)) ? ((var_1_3 + (var_1_2 - var_1_28))) : (var_1_4))))) : (var_1_23 == ((signed short int) (var_1_2 - var_1_28))))) && (var_1_24 == ((float) (var_1_25 + ((((var_1_26) < (var_1_27)) ? (var_1_26) : (var_1_27))))))) && ((! var_1_12) ? (var_1_28 == ((unsigned char) ((((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) + var_1_29) - var_1_4))) : (var_1_28 == ((unsigned char) ((((((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) > (var_1_3)) ? (((((var_1_29) < (var_1_4)) ? (var_1_29) : (var_1_4)))) : (var_1_3))))))) && (((var_1_24 / var_1_31) > var_1_24) ? (var_1_30 == ((unsigned short int) (((((var_1_33) > (var_1_34)) ? (var_1_33) : (var_1_34))) - var_1_4))) : 1) ; [L203] RET, EXPR property() [L203] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_17=256, last_1_var_1_19=-100, last_1_var_1_1=-100, last_1_var_1_20=32, last_1_var_1_23=-256, last_1_var_1_28=32, last_1_var_1_7=16, var_1_12=0, var_1_13=0, var_1_14=1, var_1_15=1, var_1_16=1, var_1_17=2, var_1_19=0, var_1_1=127, var_1_20=127, var_1_21=1, var_1_23=0, var_1_28=191, var_1_29=-192, var_1_2=383, var_1_30=65534, var_1_33=163839, var_1_34=131070, var_1_3=127, var_1_4=0, var_1_7=2, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 102.3s, OverallIterations: 17, TraceHistogramMax: 25, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 50.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 9304 SdHoareTripleChecker+Valid, 29.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9246 mSDsluCounter, 12627 SdHoareTripleChecker+Invalid, 27.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10335 mSDsCounter, 1320 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14115 IncrementalHoareTripleChecker+Invalid, 15435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1320 mSolverCounterUnsat, 2292 mSDtfsCounter, 14115 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2227 GetRequests, 1826 SyntacticMatches, 2 SemanticMatches, 399 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8059 ImplicationChecksByTransitivity, 27.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1691occurred in iteration=16, InterpolantAutomatonStates: 320, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 7038 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 45.8s InterpolantComputationTime, 3602 NumberOfCodeBlocks, 3602 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 3579 ConstructedInterpolants, 0 QuantifiedInterpolants, 37774 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1256 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 21 InterpolantComputations, 13 PerfectInterpolantSequences, 24546/25200 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 could not prove your program: unable to determine feasibility of some traces [2024-11-13 14:43:34,365 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 14:43:34,402 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd --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 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 14:43:36,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 14:43:36,823 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 14:43:36,840 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 14:43:36,841 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 14:43:36,887 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 14:43:36,890 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 14:43:36,890 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 14:43:36,891 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 14:43:36,891 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 14:43:36,892 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 14:43:36,892 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 14:43:36,893 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 14:43:36,893 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 14:43:36,894 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 14:43:36,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 14:43:36,894 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 14:43:36,894 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 14:43:36,894 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 14:43:36,895 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 14:43:36,895 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 14:43:36,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 14:43:36,895 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 14:43:36,895 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 14:43:36,895 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 14:43:36,895 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 14:43:36,895 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 14:43:36,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 14:43:36,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 14:43:36,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 14:43:36,896 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 14:43:36,896 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 14:43:36,896 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 14:43:36,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 14:43:36,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:43:36,898 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 14:43:36,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 14:43:36,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 14:43:36,898 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 14:43:36,898 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 14:43:36,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 14:43:36,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 14:43:36,899 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 14:43:36,899 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 14:43:36,899 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd 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 -> 3acf5bb1790d9b138c6c0c5b597980df4579e90442c07b1f46b433fc4941b9a8 [2024-11-13 14:43:37,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 14:43:37,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 14:43:37,256 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 14:43:37,257 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 14:43:37,257 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 14:43:37,259 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i Unable to find full path for "g++" [2024-11-13 14:43:39,162 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 14:43:39,436 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 14:43:39,437 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-13 14:43:39,447 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/data/183711dff/e06004e50bc34dfa94dc7bdd8470836a/FLAG6e3724b08 [2024-11-13 14:43:39,727 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/data/183711dff/e06004e50bc34dfa94dc7bdd8470836a [2024-11-13 14:43:39,730 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 14:43:39,732 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 14:43:39,733 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 14:43:39,734 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 14:43:39,738 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 14:43:39,739 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:43:39" (1/1) ... [2024-11-13 14:43:39,740 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2819be6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:39, skipping insertion in model container [2024-11-13 14:43:39,740 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 02:43:39" (1/1) ... [2024-11-13 14:43:39,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 14:43:39,937 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-13 14:43:40,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:43:40,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 14:43:40,118 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-53.i[916,929] [2024-11-13 14:43:40,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 14:43:40,233 INFO L204 MainTranslator]: Completed translation [2024-11-13 14:43:40,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40 WrapperNode [2024-11-13 14:43:40,234 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 14:43:40,235 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 14:43:40,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 14:43:40,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 14:43:40,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,256 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,285 INFO L138 Inliner]: procedures = 27, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-13 14:43:40,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 14:43:40,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 14:43:40,286 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 14:43:40,286 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 14:43:40,299 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,299 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,307 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,322 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-13 14:43:40,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,322 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,340 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,348 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,353 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 14:43:40,354 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 14:43:40,354 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 14:43:40,354 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 14:43:40,355 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (1/1) ... [2024-11-13 14:43:40,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 14:43:40,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:43:40,388 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 14:43:40,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 14:43:40,415 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 14:43:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 14:43:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 14:43:40,416 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 14:43:40,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 14:43:40,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 14:43:40,506 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 14:43:40,508 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 14:43:53,961 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-13 14:43:53,961 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 14:43:53,979 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 14:43:53,980 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 14:43:53,981 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:43:53 BoogieIcfgContainer [2024-11-13 14:43:53,981 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 14:43:53,983 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 14:43:53,983 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 14:43:53,988 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 14:43:53,988 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 02:43:39" (1/3) ... [2024-11-13 14:43:53,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6432d568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:43:53, skipping insertion in model container [2024-11-13 14:43:53,990 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 02:43:40" (2/3) ... [2024-11-13 14:43:53,990 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6432d568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 02:43:53, skipping insertion in model container [2024-11-13 14:43:53,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 02:43:53" (3/3) ... [2024-11-13 14:43:53,993 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-53.i [2024-11-13 14:43:54,008 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 14:43:54,009 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-53.i that has 2 procedures, 85 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 14:43:54,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 14:43:54,108 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71ae8bc1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 14:43:54,109 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 14:43:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 14:43:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 14:43:54,126 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:43:54,127 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:54,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:43:54,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:54,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1551552942, now seen corresponding path program 1 times [2024-11-13 14:43:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:54,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952327373] [2024-11-13 14:43:54,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:54,146 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:43:54,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:43:54,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:43:54,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-13 14:43:55,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:55,341 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 14:43:55,350 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:43:55,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2024-11-13 14:43:55,419 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 14:43:55,420 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:43:55,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952327373] [2024-11-13 14:43:55,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952327373] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 14:43:55,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 14:43:55,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 14:43:55,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836350996] [2024-11-13 14:43:55,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:43:55,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 14:43:55,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:43:55,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 14:43:55,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:43:55,454 INFO L87 Difference]: Start difference. First operand has 85 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-13 14:43:55,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:43:55,481 INFO L93 Difference]: Finished difference Result 163 states and 281 transitions. [2024-11-13 14:43:55,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 14:43:55,482 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 167 [2024-11-13 14:43:55,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:43:55,493 INFO L225 Difference]: With dead ends: 163 [2024-11-13 14:43:55,493 INFO L226 Difference]: Without dead ends: 81 [2024-11-13 14:43:55,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 14:43:55,502 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 14:43:55,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 14:43:55,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-13 14:43:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-13 14:43:55,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.3703703703703705) internal successors, (74), 54 states have internal predecessors, (74), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 14:43:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 124 transitions. [2024-11-13 14:43:55,565 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 124 transitions. Word has length 167 [2024-11-13 14:43:55,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:43:55,567 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 124 transitions. [2024-11-13 14:43:55,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-13 14:43:55,567 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 124 transitions. [2024-11-13 14:43:55,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 14:43:55,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:43:55,573 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:43:55,595 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-13 14:43:55,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:43:55,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:43:55,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:43:55,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1372094824, now seen corresponding path program 1 times [2024-11-13 14:43:55,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:43:55,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [41618591] [2024-11-13 14:43:55,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:43:55,778 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:43:55,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:43:55,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:43:55,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-13 14:43:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:43:56,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-13 14:43:56,874 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:44:00,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 514 proven. 51 refuted. 0 times theorem prover too weak. 635 trivial. 0 not checked. [2024-11-13 14:44:00,336 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:44:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 21 proven. 51 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-13 14:44:03,554 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:44:03,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [41618591] [2024-11-13 14:44:03,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [41618591] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:44:03,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:44:03,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-13 14:44:03,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202557901] [2024-11-13 14:44:03,557 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:44:03,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 14:44:03,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:44:03,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 14:44:03,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-13 14:44:03,565 INFO L87 Difference]: Start difference. First operand 81 states and 124 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-13 14:44:10,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:12,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:44:13,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:44:13,221 INFO L93 Difference]: Finished difference Result 168 states and 253 transitions. [2024-11-13 14:44:13,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-13 14:44:13,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 167 [2024-11-13 14:44:13,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:44:13,357 INFO L225 Difference]: With dead ends: 168 [2024-11-13 14:44:13,357 INFO L226 Difference]: Without dead ends: 90 [2024-11-13 14:44:13,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-13 14:44:13,359 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 52 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:44:13,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 301 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 188 Invalid, 1 Unknown, 0 Unchecked, 9.1s Time] [2024-11-13 14:44:13,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-13 14:44:13,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2024-11-13 14:44:13,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.3157894736842106) internal successors, (75), 57 states have internal predecessors, (75), 25 states have call successors, (25), 2 states have call predecessors, (25), 2 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-13 14:44:13,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 125 transitions. [2024-11-13 14:44:13,378 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 125 transitions. Word has length 167 [2024-11-13 14:44:13,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:44:13,379 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 125 transitions. [2024-11-13 14:44:13,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2024-11-13 14:44:13,379 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 125 transitions. [2024-11-13 14:44:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-13 14:44:13,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:44:13,382 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:44:13,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-13 14:44:13,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:44:13,583 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:44:13,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:44:13,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1370247782, now seen corresponding path program 1 times [2024-11-13 14:44:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:44:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1145238058] [2024-11-13 14:44:13,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:13,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:44:13,584 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:44:13,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:44:13,589 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-13 14:44:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:14,604 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-13 14:44:14,609 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:44:30,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 332 proven. 177 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2024-11-13 14:44:30,816 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:44:32,213 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:44:32,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1145238058] [2024-11-13 14:44:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1145238058] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:44:32,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1194613432] [2024-11-13 14:44:32,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:44:32,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:44:32,214 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 14:44:32,216 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 14:44:32,218 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 14:44:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:44:34,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-13 14:44:34,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:44:49,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 332 proven. 177 refuted. 0 times theorem prover too weak. 691 trivial. 0 not checked. [2024-11-13 14:44:49,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:44:53,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1194613432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 14:44:53,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:44:53,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15] total 17 [2024-11-13 14:44:53,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681154390] [2024-11-13 14:44:53,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:44:53,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-13 14:44:53,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:44:53,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-13 14:44:53,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=467, Unknown=0, NotChecked=0, Total=600 [2024-11-13 14:44:53,960 INFO L87 Difference]: Start difference. First operand 85 states and 125 transitions. Second operand has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-13 14:45:12,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:16,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:20,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:24,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:28,751 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:32,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:36,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:40,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:44,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:48,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:53,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:45:57,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:01,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:05,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:09,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:13,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:17,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:21,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:25,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:29,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:33,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:37,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:42,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:46,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:50,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:54,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:46:58,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:02,436 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:06,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:12,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:16,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:20,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:47:24,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:28,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:32,228 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:37,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.37s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:41,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:45,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:49,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:53,538 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:47:57,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:01,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:05,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:09,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:13,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:17,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:21,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:25,596 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:29,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:33,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:37,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:48,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:52,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:48:56,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-13 14:49:01,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:05,208 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:09,252 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:13,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:49:13,262 INFO L93 Difference]: Finished difference Result 377 states and 538 transitions. [2024-11-13 14:49:13,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-13 14:49:13,398 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) Word has length 167 [2024-11-13 14:49:13,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:49:13,401 INFO L225 Difference]: With dead ends: 377 [2024-11-13 14:49:13,402 INFO L226 Difference]: Without dead ends: 295 [2024-11-13 14:49:13,404 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 464 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 558 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=464, Invalid=1606, Unknown=0, NotChecked=0, Total=2070 [2024-11-13 14:49:13,405 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 580 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 801 mSolverCounterSat, 67 mSolverCounterUnsat, 58 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 252.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 580 SdHoareTripleChecker+Valid, 766 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 801 IncrementalHoareTripleChecker+Invalid, 58 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 254.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:49:13,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [580 Valid, 766 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 801 Invalid, 58 Unknown, 0 Unchecked, 254.1s Time] [2024-11-13 14:49:13,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-11-13 14:49:13,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 187. [2024-11-13 14:49:13,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 125 states have internal predecessors, (157), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 14:49:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 265 transitions. [2024-11-13 14:49:13,457 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 265 transitions. Word has length 167 [2024-11-13 14:49:13,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:49:13,458 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 265 transitions. [2024-11-13 14:49:13,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.888888888888889) internal successors, (70), 16 states have internal predecessors, (70), 4 states have call successors, (25), 4 states have call predecessors, (25), 6 states have return successors, (25), 4 states have call predecessors, (25), 4 states have call successors, (25) [2024-11-13 14:49:13,458 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 265 transitions. [2024-11-13 14:49:13,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:49:13,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:49:13,461 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:49:13,483 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-13 14:49:13,730 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 14:49:13,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 14:49:13,862 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:49:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:49:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash 2016269830, now seen corresponding path program 1 times [2024-11-13 14:49:13,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:49:13,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522174583] [2024-11-13 14:49:13,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:49:13,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:49:13,864 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:49:13,865 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:49:13,867 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-13 14:49:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:49:14,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:49:14,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:49:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 620 proven. 78 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2024-11-13 14:49:20,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:49:23,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 1128 trivial. 0 not checked. [2024-11-13 14:49:23,139 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:49:23,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522174583] [2024-11-13 14:49:23,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522174583] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 14:49:23,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 14:49:23,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2024-11-13 14:49:23,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42747011] [2024-11-13 14:49:23,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 14:49:23,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 14:49:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:49:23,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 14:49:23,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-13 14:49:23,142 INFO L87 Difference]: Start difference. First operand 187 states and 265 transitions. Second operand has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-13 14:49:31,430 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:35,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:39,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:43,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:47,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:51,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:55,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:49:59,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:03,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:07,540 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:11,557 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:15,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:19,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:23,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:27,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-13 14:50:34,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:50:34,409 INFO L93 Difference]: Finished difference Result 567 states and 786 transitions. [2024-11-13 14:50:34,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-13 14:50:34,410 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) Word has length 168 [2024-11-13 14:50:34,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:50:34,420 INFO L225 Difference]: With dead ends: 567 [2024-11-13 14:50:34,420 INFO L226 Difference]: Without dead ends: 459 [2024-11-13 14:50:34,421 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 327 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=296, Invalid=760, Unknown=0, NotChecked=0, Total=1056 [2024-11-13 14:50:34,422 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 357 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 180 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 68.1s IncrementalHoareTripleChecker+Time [2024-11-13 14:50:34,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 552 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 496 Invalid, 15 Unknown, 0 Unchecked, 68.1s Time] [2024-11-13 14:50:34,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-13 14:50:34,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 229. [2024-11-13 14:50:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 162 states have (on average 1.2345679012345678) internal successors, (200), 163 states have internal predecessors, (200), 54 states have call successors, (54), 12 states have call predecessors, (54), 12 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 14:50:34,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 308 transitions. [2024-11-13 14:50:34,489 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 308 transitions. Word has length 168 [2024-11-13 14:50:34,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:50:34,490 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 308 transitions. [2024-11-13 14:50:34,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.5) internal successors, (78), 12 states have internal predecessors, (78), 3 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (40), 3 states have call predecessors, (40), 3 states have call successors, (40) [2024-11-13 14:50:34,490 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 308 transitions. [2024-11-13 14:50:34,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:50:34,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:50:34,493 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:50:34,512 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-13 14:50:34,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:50:34,694 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:50:34,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:50:34,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1439238189, now seen corresponding path program 1 times [2024-11-13 14:50:34,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:50:34,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [969042972] [2024-11-13 14:50:34,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:50:34,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:50:34,695 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:50:34,696 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:50:34,698 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-13 14:50:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:50:35,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-13 14:50:35,645 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:50:43,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 414 proven. 57 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2024-11-13 14:50:43,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 14:50:45,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-13 14:50:45,352 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 14:50:45,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [969042972] [2024-11-13 14:50:45,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [969042972] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-13 14:50:45,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 14:50:45,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2024-11-13 14:50:45,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928617515] [2024-11-13 14:50:45,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 14:50:45,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 14:50:45,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 14:50:45,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 14:50:45,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:50:45,354 INFO L87 Difference]: Start difference. First operand 229 states and 308 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:50:50,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 14:50:54,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 14:50:58,748 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.31s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 14:51:02,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 14:51:06,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 14:51:11,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 14:51:15,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 14:51:20,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 14:51:24,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-13 14:51:24,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 14:51:24,564 INFO L93 Difference]: Finished difference Result 420 states and 572 transitions. [2024-11-13 14:51:24,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 14:51:24,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 168 [2024-11-13 14:51:24,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 14:51:24,704 INFO L225 Difference]: With dead ends: 420 [2024-11-13 14:51:24,705 INFO L226 Difference]: Without dead ends: 317 [2024-11-13 14:51:24,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-13 14:51:24,706 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 115 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.2s IncrementalHoareTripleChecker+Time [2024-11-13 14:51:24,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 244 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 8 Unknown, 0 Unchecked, 39.2s Time] [2024-11-13 14:51:24,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-13 14:51:24,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 233. [2024-11-13 14:51:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 165 states have (on average 1.2363636363636363) internal successors, (204), 166 states have internal predecessors, (204), 54 states have call successors, (54), 13 states have call predecessors, (54), 13 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-13 14:51:24,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 312 transitions. [2024-11-13 14:51:24,767 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 312 transitions. Word has length 168 [2024-11-13 14:51:24,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 14:51:24,769 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 312 transitions. [2024-11-13 14:51:24,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2024-11-13 14:51:24,769 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 312 transitions. [2024-11-13 14:51:24,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-13 14:51:24,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 14:51:24,775 INFO L215 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 14:51:24,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-13 14:51:24,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:51:24,975 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 14:51:24,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 14:51:24,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1016536363, now seen corresponding path program 1 times [2024-11-13 14:51:24,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 14:51:24,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233004942] [2024-11-13 14:51:24,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 14:51:24,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-13 14:51:24,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 14:51:24,978 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-13 14:51:24,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d57f33f6-6c5f-4b7c-845e-e2a024ba0007/bin/uautomizer-verify-qhAvR1uOyd/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-13 14:51:26,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 14:51:26,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-13 14:51:26,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 14:53:07,108 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 84 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:53:32,567 WARN L286 SmtUtils]: Spent 11.60s on a formula simplification that was a NOOP. DAG size: 88 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-13 14:53:41,095 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:53:49,630 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:53:58,155 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:06,613 WARN L286 SmtUtils]: Spent 8.46s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:15,088 WARN L286 SmtUtils]: Spent 8.47s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:23,580 WARN L286 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:32,158 WARN L286 SmtUtils]: Spent 8.58s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:40,640 WARN L286 SmtUtils]: Spent 8.48s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:49,179 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:54:57,848 WARN L286 SmtUtils]: Spent 8.67s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:06,214 WARN L286 SmtUtils]: Spent 8.36s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:14,751 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:23,289 WARN L286 SmtUtils]: Spent 8.54s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:31,844 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:40,372 WARN L286 SmtUtils]: Spent 8.53s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:48,897 WARN L286 SmtUtils]: Spent 8.52s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:55:57,451 WARN L286 SmtUtils]: Spent 8.55s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-13 14:56:06,024 WARN L286 SmtUtils]: Spent 8.57s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)