./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.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_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:34:16,692 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:34:16,801 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-13 13:34:16,807 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:34:16,807 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:34:16,843 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:34:16,844 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:34:16,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:34:16,846 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:34:16,847 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:34:16,848 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:34:16,848 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:34:16,849 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:34:16,849 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:34:16,850 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:34:16,850 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:34:16,850 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:34:16,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:34:16,851 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:34:16,851 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:34:16,851 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:34:16,851 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:34:16,851 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:34:16,851 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:34:16,851 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:34:16,851 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:34:16,852 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:34:16,852 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:34:16,852 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:34:16,853 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:34:16,853 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:34:16,853 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:34:16,853 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:34:16,853 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:34:16,854 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:34:16,854 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:34:16,854 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:34:16,854 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:34:16,854 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:34:16,854 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:34:16,855 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:34:16,855 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:34:16,855 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_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 -> 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba [2024-11-13 13:34:17,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:34:17,217 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:34:17,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:34:17,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:34:17,224 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:34:17,225 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i Unable to find full path for "g++" [2024-11-13 13:34:19,133 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:34:19,591 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:34:19,591 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2024-11-13 13:34:19,604 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/data/0b23169fc/3c30171ce058419ca0a3ae5709a1b15d/FLAG5b2a57593 [2024-11-13 13:34:19,621 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/data/0b23169fc/3c30171ce058419ca0a3ae5709a1b15d [2024-11-13 13:34:19,623 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:34:19,625 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:34:19,627 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:34:19,627 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:34:19,633 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:34:19,634 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:19,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c7fc83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19, skipping insertion in model container [2024-11-13 13:34:19,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:19,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:34:19,800 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_e5177563-d3a2-4f49-98ad-70adbc0f6019/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931] [2024-11-13 13:34:19,876 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:34:19,895 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:34:19,905 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_e5177563-d3a2-4f49-98ad-70adbc0f6019/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931] [2024-11-13 13:34:19,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:34:19,960 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:34:19,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19 WrapperNode [2024-11-13 13:34:19,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:34:19,962 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:34:19,962 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:34:19,963 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:34:19,970 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:19,984 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,045 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 225 [2024-11-13 13:34:20,045 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:34:20,046 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:34:20,046 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:34:20,046 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:34:20,055 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,056 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,059 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,074 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 13:34:20,074 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,075 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,083 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,087 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,090 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,095 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:34:20,096 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:34:20,096 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:34:20,097 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:34:20,098 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (1/1) ... [2024-11-13 13:34:20,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:34:20,128 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:20,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:34:20,142 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:34:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:34:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:34:20,165 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:34:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:34:20,165 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:34:20,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:34:20,244 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:34:20,246 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:34:20,803 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-13 13:34:20,804 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:34:20,825 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:34:20,826 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:34:20,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:20 BoogieIcfgContainer [2024-11-13 13:34:20,827 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:34:20,830 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:34:20,830 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:34:20,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:34:20,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:34:19" (1/3) ... [2024-11-13 13:34:20,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e524d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:34:20, skipping insertion in model container [2024-11-13 13:34:20,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:34:19" (2/3) ... [2024-11-13 13:34:20,838 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e524d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:34:20, skipping insertion in model container [2024-11-13 13:34:20,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:20" (3/3) ... [2024-11-13 13:34:20,839 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2024-11-13 13:34:20,858 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:34:20,859 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i that has 2 procedures, 97 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:34:20,942 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:34:20,958 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;@7a66c1cd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:34:20,960 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:34:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:34:21,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 13:34:21,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:21,009 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:21,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:21,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1551294431, now seen corresponding path program 1 times [2024-11-13 13:34:21,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:21,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930466296] [2024-11-13 13:34:21,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:21,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:21,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:21,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:21,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:21,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:21,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:21,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:21,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:21,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:21,530 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:21,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:21,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930466296] [2024-11-13 13:34:21,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930466296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:21,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:21,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:34:21,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735937056] [2024-11-13 13:34:21,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:21,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:34:21,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:21,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:34:21,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:34:21,569 INFO L87 Difference]: Start difference. First operand has 97 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 76 states have internal predecessors, (113), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 13:34:21,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:21,603 INFO L93 Difference]: Finished difference Result 187 states and 315 transitions. [2024-11-13 13:34:21,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:34:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2024-11-13 13:34:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:21,612 INFO L225 Difference]: With dead ends: 187 [2024-11-13 13:34:21,612 INFO L226 Difference]: Without dead ends: 93 [2024-11-13 13:34:21,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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 13:34:21,618 INFO L432 NwaCegarLoop]: 143 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, 143 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 13:34:21,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:34:21,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-13 13:34:21,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-13 13:34:21,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 72 states have (on average 1.4583333333333333) internal successors, (105), 72 states have internal predecessors, (105), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:34:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2024-11-13 13:34:21,670 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 137 [2024-11-13 13:34:21,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:21,670 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2024-11-13 13:34:21,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 22.5) internal successors, (45), 2 states have internal predecessors, (45), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 13:34:21,671 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2024-11-13 13:34:21,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-13 13:34:21,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:21,678 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:21,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:34:21,679 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:21,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:21,680 INFO L85 PathProgramCache]: Analyzing trace with hash -2144418203, now seen corresponding path program 1 times [2024-11-13 13:34:21,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:21,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458719209] [2024-11-13 13:34:21,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:21,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:21,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:22,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:22,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:22,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:22,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:22,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,170 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:22,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:22,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458719209] [2024-11-13 13:34:22,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458719209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:22,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:22,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:34:22,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564705165] [2024-11-13 13:34:22,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:22,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:34:22,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:22,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:34:22,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:22,176 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:22,218 INFO L93 Difference]: Finished difference Result 184 states and 285 transitions. [2024-11-13 13:34:22,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:34:22,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 137 [2024-11-13 13:34:22,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:22,223 INFO L225 Difference]: With dead ends: 184 [2024-11-13 13:34:22,224 INFO L226 Difference]: Without dead ends: 94 [2024-11-13 13:34:22,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:22,228 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:22,228 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:34:22,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-13 13:34:22,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-13 13:34:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.452054794520548) internal successors, (106), 73 states have internal predecessors, (106), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:34:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 144 transitions. [2024-11-13 13:34:22,249 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 144 transitions. Word has length 137 [2024-11-13 13:34:22,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:22,254 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 144 transitions. [2024-11-13 13:34:22,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:22,254 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 144 transitions. [2024-11-13 13:34:22,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 13:34:22,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:22,257 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:22,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:34:22,257 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:22,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:22,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1356901359, now seen corresponding path program 1 times [2024-11-13 13:34:22,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:22,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303709944] [2024-11-13 13:34:22,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:22,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:22,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:22,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:22,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:22,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:22,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:22,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:22,548 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:22,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:22,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303709944] [2024-11-13 13:34:22,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303709944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:22,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:22,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:34:22,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537897542] [2024-11-13 13:34:22,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:22,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:34:22,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:22,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:34:22,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:22,553 INFO L87 Difference]: Start difference. First operand 94 states and 144 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:22,656 INFO L93 Difference]: Finished difference Result 253 states and 387 transitions. [2024-11-13 13:34:22,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:34:22,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-13 13:34:22,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:22,660 INFO L225 Difference]: With dead ends: 253 [2024-11-13 13:34:22,660 INFO L226 Difference]: Without dead ends: 162 [2024-11-13 13:34:22,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:22,665 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 99 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:22,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 293 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:34:22,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-11-13 13:34:22,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2024-11-13 13:34:22,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 125 states have internal predecessors, (176), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-13 13:34:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 240 transitions. [2024-11-13 13:34:22,697 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 240 transitions. Word has length 138 [2024-11-13 13:34:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:22,697 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 240 transitions. [2024-11-13 13:34:22,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 240 transitions. [2024-11-13 13:34:22,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 13:34:22,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:22,704 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:22,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:34:22,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:22,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:22,705 INFO L85 PathProgramCache]: Analyzing trace with hash 335833005, now seen corresponding path program 1 times [2024-11-13 13:34:22,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:22,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052171805] [2024-11-13 13:34:22,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:22,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:26,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:26,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:26,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:26,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:26,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:26,581 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:26,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:26,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052171805] [2024-11-13 13:34:26,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052171805] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:26,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:26,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-13 13:34:26,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940152538] [2024-11-13 13:34:26,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:26,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:34:26,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:26,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:34:26,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:34:26,586 INFO L87 Difference]: Start difference. First operand 159 states and 240 transitions. Second operand has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 13:34:29,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:29,182 INFO L93 Difference]: Finished difference Result 571 states and 865 transitions. [2024-11-13 13:34:29,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:34:29,183 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 138 [2024-11-13 13:34:29,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:29,191 INFO L225 Difference]: With dead ends: 571 [2024-11-13 13:34:29,191 INFO L226 Difference]: Without dead ends: 415 [2024-11-13 13:34:29,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-13 13:34:29,197 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 507 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 507 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:29,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [507 Valid, 436 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-13 13:34:29,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2024-11-13 13:34:29,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 384. [2024-11-13 13:34:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 315 states have (on average 1.4634920634920634) internal successors, (461), 317 states have internal predecessors, (461), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 13:34:29,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 589 transitions. [2024-11-13 13:34:29,273 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 589 transitions. Word has length 138 [2024-11-13 13:34:29,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:29,276 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 589 transitions. [2024-11-13 13:34:29,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.181818181818182) internal successors, (46), 11 states have internal predecessors, (46), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 13:34:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 589 transitions. [2024-11-13 13:34:29,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 13:34:29,280 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:29,281 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:29,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:34:29,281 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:29,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:29,282 INFO L85 PathProgramCache]: Analyzing trace with hash 397872619, now seen corresponding path program 1 times [2024-11-13 13:34:29,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:29,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545389067] [2024-11-13 13:34:29,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:29,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:30,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:30,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:30,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:30,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:30,689 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:30,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545389067] [2024-11-13 13:34:30,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545389067] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:30,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:30,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:34:30,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912799303] [2024-11-13 13:34:30,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:30,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:34:30,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:30,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:34:30,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:34:30,691 INFO L87 Difference]: Start difference. First operand 384 states and 589 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:31,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:31,679 INFO L93 Difference]: Finished difference Result 895 states and 1366 transitions. [2024-11-13 13:34:31,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:34:31,681 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-13 13:34:31,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:31,685 INFO L225 Difference]: With dead ends: 895 [2024-11-13 13:34:31,687 INFO L226 Difference]: Without dead ends: 514 [2024-11-13 13:34:31,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:34:31,690 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 213 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:31,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 480 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-13 13:34:31,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2024-11-13 13:34:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 388. [2024-11-13 13:34:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 319 states have (on average 1.457680250783699) internal successors, (465), 321 states have internal predecessors, (465), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 13:34:31,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 593 transitions. [2024-11-13 13:34:31,755 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 593 transitions. Word has length 138 [2024-11-13 13:34:31,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:31,755 INFO L471 AbstractCegarLoop]: Abstraction has 388 states and 593 transitions. [2024-11-13 13:34:31,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 593 transitions. [2024-11-13 13:34:31,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-13 13:34:31,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:31,761 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:31,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:34:31,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:31,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:31,762 INFO L85 PathProgramCache]: Analyzing trace with hash 845306095, now seen corresponding path program 1 times [2024-11-13 13:34:31,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:31,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223943841] [2024-11-13 13:34:31,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:31,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:34,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:34,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:34,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:34,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:34,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:34,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:34,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:34,690 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:34,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:34,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223943841] [2024-11-13 13:34:34,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223943841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:34,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:34,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-13 13:34:34,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294026951] [2024-11-13 13:34:34,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:34,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-13 13:34:34,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:34,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-13 13:34:34,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-13 13:34:34,694 INFO L87 Difference]: Start difference. First operand 388 states and 593 transitions. Second operand has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:36,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:36,824 INFO L93 Difference]: Finished difference Result 815 states and 1244 transitions. [2024-11-13 13:34:36,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:34:36,825 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 138 [2024-11-13 13:34:36,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:36,831 INFO L225 Difference]: With dead ends: 815 [2024-11-13 13:34:36,834 INFO L226 Difference]: Without dead ends: 588 [2024-11-13 13:34:36,834 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-13 13:34:36,835 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 213 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:36,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 591 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-13 13:34:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 588 states. [2024-11-13 13:34:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 588 to 390. [2024-11-13 13:34:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 321 states have (on average 1.4579439252336448) internal successors, (468), 323 states have internal predecessors, (468), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 13:34:36,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 596 transitions. [2024-11-13 13:34:36,886 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 596 transitions. Word has length 138 [2024-11-13 13:34:36,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:36,887 INFO L471 AbstractCegarLoop]: Abstraction has 390 states and 596 transitions. [2024-11-13 13:34:36,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.75) internal successors, (46), 8 states have internal predecessors, (46), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:36,888 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 596 transitions. [2024-11-13 13:34:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 13:34:36,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:36,892 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:36,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:34:36,893 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:36,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 366284776, now seen corresponding path program 1 times [2024-11-13 13:34:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:36,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111133206] [2024-11-13 13:34:36,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:36,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:37,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:37,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:37,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:37,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:37,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:37,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:37,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,193 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-13 13:34:37,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:37,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111133206] [2024-11-13 13:34:37,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111133206] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:34:37,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [548625182] [2024-11-13 13:34:37,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:37,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:37,194 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:37,196 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:34:37,200 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:34:37,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:37,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-13 13:34:37,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:34:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:37,579 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:34:37,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [548625182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:37,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:34:37,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2024-11-13 13:34:37,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165930197] [2024-11-13 13:34:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:37,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-13 13:34:37,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:37,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-13 13:34:37,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:34:37,581 INFO L87 Difference]: Start difference. First operand 390 states and 596 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:37,920 INFO L93 Difference]: Finished difference Result 1012 states and 1536 transitions. [2024-11-13 13:34:37,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:34:37,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-13 13:34:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:37,925 INFO L225 Difference]: With dead ends: 1012 [2024-11-13 13:34:37,925 INFO L226 Difference]: Without dead ends: 625 [2024-11-13 13:34:37,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:34:37,927 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 58 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:37,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 566 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:34:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-13 13:34:37,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 619. [2024-11-13 13:34:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 538 states have (on average 1.4646840148698885) internal successors, (788), 544 states have internal predecessors, (788), 72 states have call successors, (72), 8 states have call predecessors, (72), 8 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 13:34:37,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 932 transitions. [2024-11-13 13:34:37,984 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 932 transitions. Word has length 140 [2024-11-13 13:34:37,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:37,984 INFO L471 AbstractCegarLoop]: Abstraction has 619 states and 932 transitions. [2024-11-13 13:34:37,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:37,985 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 932 transitions. [2024-11-13 13:34:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 13:34:37,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:37,988 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:38,010 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:34:38,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-13 13:34:38,192 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:38,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:38,193 INFO L85 PathProgramCache]: Analyzing trace with hash 64519496, now seen corresponding path program 1 times [2024-11-13 13:34:38,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:38,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032623747] [2024-11-13 13:34:38,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:38,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:38,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:38,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:38,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:38,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:38,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:38,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:38,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:38,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:38,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:38,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:38,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-13 13:34:38,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:38,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032623747] [2024-11-13 13:34:38,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032623747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:34:38,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1475193338] [2024-11-13 13:34:38,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:38,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:38,505 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:38,507 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:34:38,509 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:34:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:38,667 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-13 13:34:38,675 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:34:39,108 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 242 proven. 54 refuted. 0 times theorem prover too weak. 388 trivial. 0 not checked. [2024-11-13 13:34:39,110 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:34:39,361 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-13 13:34:39,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1475193338] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:34:39,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:34:39,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-13 13:34:39,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893457496] [2024-11-13 13:34:39,362 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:34:39,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-13 13:34:39,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-13 13:34:39,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-13 13:34:39,365 INFO L87 Difference]: Start difference. First operand 619 states and 932 transitions. Second operand has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) [2024-11-13 13:34:39,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:39,762 INFO L93 Difference]: Finished difference Result 1291 states and 1905 transitions. [2024-11-13 13:34:39,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-13 13:34:39,763 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) Word has length 140 [2024-11-13 13:34:39,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:39,770 INFO L225 Difference]: With dead ends: 1291 [2024-11-13 13:34:39,770 INFO L226 Difference]: Without dead ends: 675 [2024-11-13 13:34:39,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 312 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:34:39,773 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 337 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:39,773 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 225 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-13 13:34:39,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2024-11-13 13:34:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 667. [2024-11-13 13:34:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 574 states have (on average 1.4303135888501741) internal successors, (821), 580 states have internal predecessors, (821), 72 states have call successors, (72), 20 states have call predecessors, (72), 20 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2024-11-13 13:34:39,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 965 transitions. [2024-11-13 13:34:39,848 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 965 transitions. Word has length 140 [2024-11-13 13:34:39,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:39,850 INFO L471 AbstractCegarLoop]: Abstraction has 667 states and 965 transitions. [2024-11-13 13:34:39,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.272727272727273) internal successors, (91), 11 states have internal predecessors, (91), 6 states have call successors, (55), 3 states have call predecessors, (55), 5 states have return successors, (56), 5 states have call predecessors, (56), 6 states have call successors, (56) [2024-11-13 13:34:39,850 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 965 transitions. [2024-11-13 13:34:39,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 13:34:39,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:39,853 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:39,875 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-13 13:34:40,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:40,057 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:40,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash 205068106, now seen corresponding path program 1 times [2024-11-13 13:34:40,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:40,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465662629] [2024-11-13 13:34:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:40,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:34:40,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [427316250] [2024-11-13 13:34:40,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:40,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:40,133 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:40,135 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:34:40,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:34:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:40,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-13 13:34:40,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:34:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 250 proven. 42 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-11-13 13:34:40,732 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:34:41,136 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-13 13:34:41,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:41,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465662629] [2024-11-13 13:34:41,139 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:34:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [427316250] [2024-11-13 13:34:41,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [427316250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:34:41,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:34:41,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-13 13:34:41,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946355021] [2024-11-13 13:34:41,140 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:34:41,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:34:41,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:41,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:34:41,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:34:41,143 INFO L87 Difference]: Start difference. First operand 667 states and 965 transitions. Second operand has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-13 13:34:42,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:42,631 INFO L93 Difference]: Finished difference Result 2140 states and 3075 transitions. [2024-11-13 13:34:42,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-13 13:34:42,631 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) Word has length 140 [2024-11-13 13:34:42,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:42,653 INFO L225 Difference]: With dead ends: 2140 [2024-11-13 13:34:42,653 INFO L226 Difference]: Without dead ends: 1476 [2024-11-13 13:34:42,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 264 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=483, Unknown=0, NotChecked=0, Total=650 [2024-11-13 13:34:42,657 INFO L432 NwaCegarLoop]: 204 mSDtfsCounter, 346 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:42,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1594 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:34:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2024-11-13 13:34:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1046. [2024-11-13 13:34:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 965 states have (on average 1.5243523316062175) internal successors, (1471), 967 states have internal predecessors, (1471), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 13:34:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1599 transitions. [2024-11-13 13:34:42,736 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1599 transitions. Word has length 140 [2024-11-13 13:34:42,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:42,737 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1599 transitions. [2024-11-13 13:34:42,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.875) internal successors, (78), 16 states have internal predecessors, (78), 3 states have call successors, (33), 2 states have call predecessors, (33), 4 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2024-11-13 13:34:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1599 transitions. [2024-11-13 13:34:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-13 13:34:42,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:42,741 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:42,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:34:42,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:42,946 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:42,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:42,947 INFO L85 PathProgramCache]: Analyzing trace with hash 67556179, now seen corresponding path program 1 times [2024-11-13 13:34:42,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:42,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759867938] [2024-11-13 13:34:42,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:42,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:43,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:43,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:43,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:43,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:43,067 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:43,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:43,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759867938] [2024-11-13 13:34:43,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759867938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:43,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:43,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:34:43,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604229181] [2024-11-13 13:34:43,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:43,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:34:43,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:43,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:34:43,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:43,070 INFO L87 Difference]: Start difference. First operand 1046 states and 1599 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:43,323 INFO L93 Difference]: Finished difference Result 2287 states and 3449 transitions. [2024-11-13 13:34:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:34:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 140 [2024-11-13 13:34:43,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:43,330 INFO L225 Difference]: With dead ends: 2287 [2024-11-13 13:34:43,331 INFO L226 Difference]: Without dead ends: 1244 [2024-11-13 13:34:43,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:43,335 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 116 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:43,339 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 272 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-13 13:34:43,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2024-11-13 13:34:43,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1046. [2024-11-13 13:34:43,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1046 states, 965 states have (on average 1.5202072538860103) internal successors, (1467), 967 states have internal predecessors, (1467), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 13:34:43,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1046 states to 1046 states and 1595 transitions. [2024-11-13 13:34:43,412 INFO L78 Accepts]: Start accepts. Automaton has 1046 states and 1595 transitions. Word has length 140 [2024-11-13 13:34:43,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:43,412 INFO L471 AbstractCegarLoop]: Abstraction has 1046 states and 1595 transitions. [2024-11-13 13:34:43,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:43,413 INFO L276 IsEmpty]: Start isEmpty. Operand 1046 states and 1595 transitions. [2024-11-13 13:34:43,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 13:34:43,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:43,417 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:43,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:34:43,418 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:43,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash -685871467, now seen corresponding path program 1 times [2024-11-13 13:34:43,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:43,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863014376] [2024-11-13 13:34:43,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:43,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:46,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:46,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:46,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:46,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:46,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:46,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:46,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:46,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:46,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:46,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:46,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:46,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:46,896 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:46,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:46,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863014376] [2024-11-13 13:34:46,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863014376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:46,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:46,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-13 13:34:46,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56945575] [2024-11-13 13:34:46,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:46,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-13 13:34:46,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:46,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-13 13:34:46,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-11-13 13:34:46,900 INFO L87 Difference]: Start difference. First operand 1046 states and 1595 transitions. Second operand has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:51,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:51,430 INFO L93 Difference]: Finished difference Result 3084 states and 4691 transitions. [2024-11-13 13:34:51,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:34:51,431 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-11-13 13:34:51,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:51,440 INFO L225 Difference]: With dead ends: 3084 [2024-11-13 13:34:51,440 INFO L226 Difference]: Without dead ends: 2041 [2024-11-13 13:34:51,443 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=140, Invalid=412, Unknown=0, NotChecked=0, Total=552 [2024-11-13 13:34:51,443 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 723 mSDsluCounter, 1098 mSDsCounter, 0 mSdLazyCounter, 1421 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 723 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:51,444 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [723 Valid, 1223 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1421 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-13 13:34:51,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2041 states. [2024-11-13 13:34:51,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2041 to 1380. [2024-11-13 13:34:51,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1380 states, 1299 states have (on average 1.5242494226327945) internal successors, (1980), 1301 states have internal predecessors, (1980), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 13:34:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1380 states to 1380 states and 2108 transitions. [2024-11-13 13:34:51,527 INFO L78 Accepts]: Start accepts. Automaton has 1380 states and 2108 transitions. Word has length 141 [2024-11-13 13:34:51,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:51,528 INFO L471 AbstractCegarLoop]: Abstraction has 1380 states and 2108 transitions. [2024-11-13 13:34:51,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.0625) internal successors, (49), 16 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:51,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1380 states and 2108 transitions. [2024-11-13 13:34:51,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 13:34:51,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:51,531 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:51,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:34:51,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:51,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:51,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1425325252, now seen corresponding path program 1 times [2024-11-13 13:34:51,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:51,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979099181] [2024-11-13 13:34:51,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:51,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-13 13:34:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-13 13:34:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-13 13:34:51,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-13 13:34:51,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-13 13:34:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-13 13:34:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-13 13:34:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-13 13:34:51,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-13 13:34:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-13 13:34:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-13 13:34:51,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-13 13:34:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-13 13:34:51,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-13 13:34:51,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-13 13:34:51,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-13 13:34:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-13 13:34:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-13 13:34:51,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-13 13:34:51,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:51,666 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-11-13 13:34:51,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:34:51,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979099181] [2024-11-13 13:34:51,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979099181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:34:51,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:34:51,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:34:51,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955499515] [2024-11-13 13:34:51,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:34:51,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:34:51,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:34:51,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:34:51,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:51,670 INFO L87 Difference]: Start difference. First operand 1380 states and 2108 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:51,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:34:51,842 INFO L93 Difference]: Finished difference Result 3101 states and 4746 transitions. [2024-11-13 13:34:51,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:34:51,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 141 [2024-11-13 13:34:51,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:34:51,850 INFO L225 Difference]: With dead ends: 3101 [2024-11-13 13:34:51,850 INFO L226 Difference]: Without dead ends: 1724 [2024-11-13 13:34:51,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:34:51,853 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 51 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:34:51,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 244 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-13 13:34:51,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2024-11-13 13:34:51,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1464. [2024-11-13 13:34:51,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1464 states, 1383 states have (on average 1.5213304410701374) internal successors, (2104), 1385 states have internal predecessors, (2104), 64 states have call successors, (64), 16 states have call predecessors, (64), 16 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 13:34:51,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2232 transitions. [2024-11-13 13:34:51,925 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2232 transitions. Word has length 141 [2024-11-13 13:34:51,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:34:51,927 INFO L471 AbstractCegarLoop]: Abstraction has 1464 states and 2232 transitions. [2024-11-13 13:34:51,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-11-13 13:34:51,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2232 transitions. [2024-11-13 13:34:51,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 13:34:51,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:34:51,931 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:34:51,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:34:51,932 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:34:51,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:34:51,932 INFO L85 PathProgramCache]: Analyzing trace with hash -486733035, now seen corresponding path program 1 times [2024-11-13 13:34:51,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:34:51,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176745953] [2024-11-13 13:34:51,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:51,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:34:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:34:52,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1582787873] [2024-11-13 13:34:52,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:34:52,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:34:52,033 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:34:52,036 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:34:52,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:34:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:34:52,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:34:52,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:34:52,797 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 288 proven. 39 refuted. 0 times theorem prover too weak. 357 trivial. 0 not checked. [2024-11-13 13:34:52,797 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:35:02,954 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (div c_~var_1_6~0 c_~var_1_6~0))) (and (forall ((v_z_31 Int)) (or (< .cse0 v_z_31) (= v_z_31 0) (< v_z_31 0) (< (div v_z_31 c_~var_1_6~0) v_z_31) (< 255 v_z_31))) (or (< c_~var_1_6~0 (+ (mod c_~last_1_var_1_12~0 65536) 1 c_~var_1_7~0)) (and (forall ((v_z_28 Int)) (or (< .cse0 v_z_28) (< v_z_28 0) (< (div v_z_28 c_~var_1_6~0) v_z_28))) (forall ((v_z_26 Int)) (or (< v_z_26 0) (< c_~var_1_6~0 (+ v_z_26 1)) (< (div v_z_26 c_~var_1_6~0) v_z_26))) (<= (+ 1 .cse0) c_~var_1_6~0))) (or (< .cse0 1) (< .cse0 c_~var_1_6~0)))) is different from false [2024-11-13 13:35:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 39 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-11-13 13:35:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176745953] [2024-11-13 13:35:04,382 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:35:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582787873] [2024-11-13 13:35:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582787873] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:35:04,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:35:04,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 17 [2024-11-13 13:35:04,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242224614] [2024-11-13 13:35:04,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:35:04,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-13 13:35:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:04,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-13 13:35:04,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=176, Unknown=2, NotChecked=28, Total=272 [2024-11-13 13:35:04,384 INFO L87 Difference]: Start difference. First operand 1464 states and 2232 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-13 13:35:10,343 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~last_1_var_1_12~0 65536)) (.cse1 (div c_~var_1_6~0 c_~var_1_6~0))) (and (<= c_~var_1_6~0 (+ .cse0 c_~var_1_7~0)) (forall ((v_z_31 Int)) (or (< .cse1 v_z_31) (= v_z_31 0) (< v_z_31 0) (< (div v_z_31 c_~var_1_6~0) v_z_31) (< 255 v_z_31))) (or (< c_~var_1_6~0 (+ .cse0 1 c_~var_1_7~0)) (and (forall ((v_z_28 Int)) (or (< .cse1 v_z_28) (< v_z_28 0) (< (div v_z_28 c_~var_1_6~0) v_z_28))) (forall ((v_z_26 Int)) (or (< v_z_26 0) (< c_~var_1_6~0 (+ v_z_26 1)) (< (div v_z_26 c_~var_1_6~0) v_z_26))) (<= (+ 1 .cse1) c_~var_1_6~0))) (or (< .cse1 1) (< .cse1 c_~var_1_6~0)) (<= 6 c_~var_1_6~0))) is different from false [2024-11-13 13:35:13,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:13,073 INFO L93 Difference]: Finished difference Result 3871 states and 5817 transitions. [2024-11-13 13:35:13,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-13 13:35:13,074 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 141 [2024-11-13 13:35:13,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:13,084 INFO L225 Difference]: With dead ends: 3871 [2024-11-13 13:35:13,084 INFO L226 Difference]: Without dead ends: 2368 [2024-11-13 13:35:13,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=139, Invalid=372, Unknown=3, NotChecked=86, Total=600 [2024-11-13 13:35:13,087 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 726 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 827 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 313 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:13,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 827 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 683 Invalid, 0 Unknown, 313 Unchecked, 4.0s Time] [2024-11-13 13:35:13,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2368 states. [2024-11-13 13:35:13,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2368 to 1847. [2024-11-13 13:35:13,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1847 states, 1762 states have (on average 1.489216799091941) internal successors, (2624), 1764 states have internal predecessors, (2624), 64 states have call successors, (64), 20 states have call predecessors, (64), 20 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-13 13:35:13,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2752 transitions. [2024-11-13 13:35:13,183 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2752 transitions. Word has length 141 [2024-11-13 13:35:13,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:13,185 INFO L471 AbstractCegarLoop]: Abstraction has 1847 states and 2752 transitions. [2024-11-13 13:35:13,185 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 17 states have internal predecessors, (89), 3 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2024-11-13 13:35:13,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2752 transitions. [2024-11-13 13:35:13,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 13:35:13,188 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:13,190 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:13,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:35:13,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-13 13:35:13,394 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:13,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:13,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1507801389, now seen corresponding path program 1 times [2024-11-13 13:35:13,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:13,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019885362] [2024-11-13 13:35:13,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:13,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:13,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:35:13,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [21760748] [2024-11-13 13:35:13,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:13,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:13,455 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:13,457 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:13,459 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:35:14,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:14,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-13 13:35:14,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:17,323 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-13 13:35:17,324 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:35:19,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:35:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019885362] [2024-11-13 13:35:19,231 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-13 13:35:19,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21760748] [2024-11-13 13:35:19,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21760748] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:35:19,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-13 13:35:19,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2024-11-13 13:35:19,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652205797] [2024-11-13 13:35:19,231 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-13 13:35:19,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:35:19,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:35:19,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:35:19,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:35:19,233 INFO L87 Difference]: Start difference. First operand 1847 states and 2752 transitions. Second operand has 10 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 13:35:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:21,162 INFO L93 Difference]: Finished difference Result 3666 states and 5465 transitions. [2024-11-13 13:35:21,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:35:21,162 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 141 [2024-11-13 13:35:21,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:21,168 INFO L225 Difference]: With dead ends: 3666 [2024-11-13 13:35:21,169 INFO L226 Difference]: Without dead ends: 1822 [2024-11-13 13:35:21,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:35:21,172 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 281 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-13 13:35:21,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 488 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-13 13:35:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1822 states. [2024-11-13 13:35:21,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1822 to 1234. [2024-11-13 13:35:21,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1234 states, 1165 states have (on average 1.482403433476395) internal successors, (1727), 1166 states have internal predecessors, (1727), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2024-11-13 13:35:21,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 1829 transitions. [2024-11-13 13:35:21,227 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 1829 transitions. Word has length 141 [2024-11-13 13:35:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:21,228 INFO L471 AbstractCegarLoop]: Abstraction has 1234 states and 1829 transitions. [2024-11-13 13:35:21,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.8) internal successors, (58), 8 states have internal predecessors, (58), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 13:35:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 1829 transitions. [2024-11-13 13:35:21,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-13 13:35:21,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:21,230 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:21,251 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-13 13:35:21,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-13 13:35:21,431 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:21,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:21,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2085566033, now seen corresponding path program 1 times [2024-11-13 13:35:21,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:35:21,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989380741] [2024-11-13 13:35:21,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:35:21,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-13 13:35:21,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1240316648] [2024-11-13 13:35:21,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:21,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:21,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:21,540 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-13 13:35:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:35:21,735 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-13 13:35:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-13 13:35:21,926 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-13 13:35:21,926 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-13 13:35:21,927 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-13 13:35:21,936 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-13 13:35:22,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:22,132 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:35:22,270 INFO L173 ceAbstractionStarter]: Computing trace abstraction results [2024-11-13 13:35:22,276 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.11 01:35:22 BoogieIcfgContainer [2024-11-13 13:35:22,279 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-13 13:35:22,280 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-13 13:35:22,280 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-13 13:35:22,280 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-13 13:35:22,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:34:20" (3/4) ... [2024-11-13 13:35:22,284 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-13 13:35:22,285 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-13 13:35:22,286 INFO L158 Benchmark]: Toolchain (without parser) took 62661.15ms. Allocated memory was 117.4MB in the beginning and 293.6MB in the end (delta: 176.2MB). Free memory was 92.6MB in the beginning and 155.8MB in the end (delta: -63.3MB). Peak memory consumption was 113.6MB. Max. memory is 16.1GB. [2024-11-13 13:35:22,286 INFO L158 Benchmark]: CDTParser took 1.69ms. Allocated memory is still 167.8MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:22,286 INFO L158 Benchmark]: CACSL2BoogieTranslator took 334.97ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 77.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-13 13:35:22,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.22ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 74.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:22,287 INFO L158 Benchmark]: Boogie Preprocessor took 49.61ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 71.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:22,287 INFO L158 Benchmark]: RCFGBuilder took 731.21ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 44.7MB in the end (delta: 26.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-13 13:35:22,287 INFO L158 Benchmark]: TraceAbstraction took 61449.18ms. Allocated memory was 117.4MB in the beginning and 293.6MB in the end (delta: 176.2MB). Free memory was 43.9MB in the beginning and 155.9MB in the end (delta: -112.0MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. [2024-11-13 13:35:22,287 INFO L158 Benchmark]: Witness Printer took 4.91ms. Allocated memory is still 293.6MB. Free memory was 155.9MB in the beginning and 155.8MB in the end (delta: 39.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-13 13:35:22,289 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.69ms. Allocated memory is still 167.8MB. Free memory is still 103.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 334.97ms. Allocated memory is still 117.4MB. Free memory was 92.6MB in the beginning and 77.9MB in the end (delta: 14.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.22ms. Allocated memory is still 117.4MB. Free memory was 77.9MB in the beginning and 74.7MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 49.61ms. Allocated memory is still 117.4MB. Free memory was 74.7MB in the beginning and 71.4MB in the end (delta: 3.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 731.21ms. Allocated memory is still 117.4MB. Free memory was 71.4MB in the beginning and 44.7MB in the end (delta: 26.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 61449.18ms. Allocated memory was 117.4MB in the beginning and 293.6MB in the end (delta: 176.2MB). Free memory was 43.9MB in the beginning and 155.9MB in the end (delta: -112.0MB). Peak memory consumption was 63.3MB. Max. memory is 16.1GB. * Witness Printer took 4.91ms. Allocated memory is still 293.6MB. Free memory was 155.9MB in the beginning and 155.8MB in the end (delta: 39.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 shiftLeft at line 59, overapproximation of shiftLeft at line 169, overapproximation of someBinaryFLOATComparisonOperation at line 157, overapproximation of someBinaryFLOATComparisonOperation at line 160, overapproximation of someBinaryFLOATComparisonOperation at line 161, overapproximation of someBinaryFLOATComparisonOperation at line 158, overapproximation of someUnaryDOUBLEoperation at line 40, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 149, overapproximation of someBinaryDOUBLEComparisonOperation at line 118, overapproximation of someBinaryDOUBLEComparisonOperation at line 169, overapproximation of someBinaryDOUBLEComparisonOperation at line 71. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned long int var_1_19 = 50; [L37] unsigned char var_1_23 = 64; [L38] unsigned short int var_1_26 = 32; [L39] unsigned short int var_1_28 = 64; [L40] float var_1_30 = -0.2; [L41] float var_1_32 = -0.375; [L42] float var_1_33 = 1.4; [L43] float var_1_35 = 1.5; [L44] unsigned char last_1_var_1_10 = 32; [L45] unsigned short int last_1_var_1_12 = 16; [L46] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] CALL updateLastVariables() [L164] last_1_var_1_10 = var_1_10 [L165] last_1_var_1_12 = var_1_12 [L166] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L176] RET updateLastVariables() [L177] CALL updateVariables() [L133] var_1_3 = __VERIFIER_nondet_short() [L134] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L134] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L135] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L135] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L136] var_1_5 = __VERIFIER_nondet_long() [L137] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L137] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L138] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L138] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L139] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L139] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L140] var_1_6 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L141] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L142] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L143] var_1_7 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L145] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L145] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L146] var_1_8 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_9=9/5] [L147] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_9=9/5] [L148] var_1_9 = __VERIFIER_nondet_double() [L149] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L149] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L150] var_1_11 = __VERIFIER_nondet_uchar() [L151] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L151] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L152] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L152] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L153] var_1_15 = __VERIFIER_nondet_uchar() [L154] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L154] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L155] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L155] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L156] var_1_30 = __VERIFIER_nondet_float() [L157] CALL assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L157] RET assume_abort_if_not((var_1_30 >= -922337.2036854776000e+13F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 9223372.036854776000e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L158] CALL assume_abort_if_not(var_1_30 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L158] RET assume_abort_if_not(var_1_30 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L159] var_1_32 = __VERIFIER_nondet_float() [L160] CALL assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L160] RET assume_abort_if_not((var_1_32 >= -922337.2036854776000e+13F && var_1_32 <= -1.0e-20F) || (var_1_32 <= 9223372.036854776000e+12F && var_1_32 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L161] CALL assume_abort_if_not(var_1_32 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L161] RET assume_abort_if_not(var_1_32 != 0.0F) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=16, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L177] RET updateVariables() [L178] CALL step() [L50] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L51] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=7, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L53] signed long int stepLocal_2 = last_1_var_1_12 + var_1_7; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_2=16, var_1_10=32, var_1_11=7, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L54] COND TRUE var_1_6 <= stepLocal_2 [L55] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L59] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=128, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L59] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L66] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=256, var_1_18=-2, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L68] var_1_18 = var_1_3 [L69] signed long int stepLocal_4 = (((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64))); [L70] unsigned char stepLocal_3 = var_1_10; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=256, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L71] COND FALSE !((- var_1_9) <= var_1_8) [L84] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L86] signed long int stepLocal_1 = (var_1_10 & 0) * var_1_5; VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L87] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L87] signed long int stepLocal_0 = var_1_16 >> var_1_3; [L88] COND FALSE !(stepLocal_0 == (var_1_10 / var_1_5)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L95] COND FALSE !(var_1_15 || var_1_15) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L98] COND FALSE !(((((var_1_3) < 0 ) ? -(var_1_3) : (var_1_3))) == (~ 16u)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L103] COND TRUE var_1_11 <= var_1_12 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L104] COND FALSE !(var_1_11 <= (((((var_1_11) < (var_1_6)) ? (var_1_11) : (var_1_6))) / var_1_6)) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L118] COND FALSE !((var_1_9 / var_1_30) > ((((var_1_8 / var_1_32) < 0 ) ? -(var_1_8 / var_1_32) : (var_1_8 / var_1_32)))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=7/5, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0] [L123] var_1_33 = var_1_8 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2] [L124] COND FALSE !(((256 - var_1_11) <= (var_1_11 + var_1_10)) || var_1_15) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, stepLocal_1=0, stepLocal_3=7, stepLocal_4=7, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2] [L178] RET step() [L179] CALL, EXPR property() [L169] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2] [L169] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2] [L169] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2] [L169] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2] [L169] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2] [L169-L170] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=7, var_1_11=7, var_1_12=7, var_1_13=7, var_1_15=0, var_1_16=7, var_1_18=0, var_1_19=50, var_1_1=11/2, var_1_23=64, var_1_26=32, var_1_28=64, var_1_33=2, var_1_35=3/2, var_1_3=0, var_1_5=6, var_1_6=7, var_1_7=0, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 97 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 61.2s, OverallIterations: 15, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 23.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3681 SdHoareTripleChecker+Valid, 15.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3670 mSDsluCounter, 7661 SdHoareTripleChecker+Invalid, 14.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 313 IncrementalHoareTripleChecker+Unchecked, 5755 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5170 IncrementalHoareTripleChecker+Invalid, 5648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 1906 mSDtfsCounter, 5170 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1780 GetRequests, 1635 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 20.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=13, InterpolantAutomatonStates: 118, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 3030 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 31.8s InterpolantComputationTime, 2934 NumberOfCodeBlocks, 2934 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 2632 ConstructedInterpolants, 14 QuantifiedInterpolants, 14331 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1664 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 19 InterpolantComputations, 10 PerfectInterpolantSequences, 12546/12996 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 13:35:22,505 WARN L435 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-13 13:35:22,547 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:35:25,070 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:35:25,212 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-13 13:35:25,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:35:25,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:35:25,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:35:25,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:35:25,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:35:25,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:35:25,293 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:35:25,294 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:35:25,294 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:35:25,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:35:25,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:35:25,294 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:35:25,295 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:35:25,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-13 13:35:25,295 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:35:25,295 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:35:25,295 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:35:25,295 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-13 13:35:25,295 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:35:25,295 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-13 13:35:25,295 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:35:25,296 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:35:25,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:35:25,297 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:35:25,297 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:35:25,297 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-13 13:35:25,297 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-13 13:35:25,297 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-13 13:35:25,297 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:35:25,297 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:35:25,297 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:35:25,297 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:35:25,297 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_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 -> 965493649683322c4c4531e65d7189f027c727871d6e00cfa208433dbe39feba [2024-11-13 13:35:25,591 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:35:25,600 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:35:25,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:35:25,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:35:25,604 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:35:25,606 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i Unable to find full path for "g++" [2024-11-13 13:35:27,464 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:35:27,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:35:27,726 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2024-11-13 13:35:27,737 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/data/6e37b262b/b47be8034e244f1f8cb1b934268b02cf/FLAG07dbe27a1 [2024-11-13 13:35:27,756 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/data/6e37b262b/b47be8034e244f1f8cb1b934268b02cf [2024-11-13 13:35:27,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:35:27,760 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:35:27,762 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:35:27,764 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:35:27,773 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:35:27,774 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:27" (1/1) ... [2024-11-13 13:35:27,775 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64491ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:27, skipping insertion in model container [2024-11-13 13:35:27,775 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:35:27" (1/1) ... [2024-11-13 13:35:27,807 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:35:28,004 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_e5177563-d3a2-4f49-98ad-70adbc0f6019/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931] [2024-11-13 13:35:28,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:35:28,125 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:35:28,134 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_e5177563-d3a2-4f49-98ad-70adbc0f6019/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i[918,931] [2024-11-13 13:35:28,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:35:28,185 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:35:28,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28 WrapperNode [2024-11-13 13:35:28,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:35:28,187 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:35:28,187 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:35:28,187 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:35:28,196 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,215 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,258 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 159 [2024-11-13 13:35:28,262 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:35:28,262 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:35:28,262 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:35:28,262 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:35:28,273 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,273 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,279 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,296 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 13:35:28,296 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,296 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,322 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,327 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,329 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,339 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:35:28,340 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:35:28,340 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:35:28,340 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:35:28,341 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (1/1) ... [2024-11-13 13:35:28,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:35:28,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:28,384 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:35:28,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:35:28,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:35:28,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-13 13:35:28,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-13 13:35:28,417 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-13 13:35:28,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:35:28,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:35:28,545 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:35:28,550 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:35:38,396 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-13 13:35:38,396 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:35:38,416 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:35:38,418 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-13 13:35:38,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:38 BoogieIcfgContainer [2024-11-13 13:35:38,418 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:35:38,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:35:38,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:35:38,427 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:35:38,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:35:27" (1/3) ... [2024-11-13 13:35:38,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695a5dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:38, skipping insertion in model container [2024-11-13 13:35:38,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:35:28" (2/3) ... [2024-11-13 13:35:38,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@695a5dd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:35:38, skipping insertion in model container [2024-11-13 13:35:38,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:35:38" (3/3) ... [2024-11-13 13:35:38,429 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i [2024-11-13 13:35:38,446 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:35:38,448 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-9.i that has 2 procedures, 74 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-13 13:35:38,521 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:35:38,537 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;@50a215a3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:35:38,539 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-13 13:35:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 53 states have internal predecessors, (79), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:35:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-13 13:35:38,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:38,562 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:38,563 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:38,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:38,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1092135608, now seen corresponding path program 1 times [2024-11-13 13:35:38,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:38,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [210632976] [2024-11-13 13:35:38,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:38,588 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 13:35:38,592 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:35:38,596 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 13:35:38,600 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 13:35:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:40,353 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-13 13:35:40,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:40,400 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 360 proven. 0 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2024-11-13 13:35:40,400 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-13 13:35:40,401 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:40,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [210632976] [2024-11-13 13:35:40,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [210632976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:35:40,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:35:40,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:35:40,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763411893] [2024-11-13 13:35:40,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:35:40,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-13 13:35:40,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:35:40,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-13 13:35:40,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-13 13:35:40,431 INFO L87 Difference]: Start difference. First operand has 74 states, 52 states have (on average 1.5192307692307692) internal successors, (79), 53 states have internal predecessors, (79), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 13:35:40,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:35:40,457 INFO L93 Difference]: Finished difference Result 140 states and 245 transitions. [2024-11-13 13:35:40,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-13 13:35:40,459 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 129 [2024-11-13 13:35:40,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:35:40,465 INFO L225 Difference]: With dead ends: 140 [2024-11-13 13:35:40,465 INFO L226 Difference]: Without dead ends: 69 [2024-11-13 13:35:40,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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 13:35:40,473 INFO L432 NwaCegarLoop]: 106 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, 106 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 13:35:40,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-13 13:35:40,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-13 13:35:40,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-13 13:35:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 48 states have internal predecessors, (68), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-13 13:35:40,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 106 transitions. [2024-11-13 13:35:40,514 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 106 transitions. Word has length 129 [2024-11-13 13:35:40,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:35:40,514 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 106 transitions. [2024-11-13 13:35:40,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-11-13 13:35:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 106 transitions. [2024-11-13 13:35:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 13:35:40,518 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:35:40,519 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:35:40,549 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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)] Ended with exit code 0 [2024-11-13 13:35:40,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 13:35:40,720 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:35:40,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:35:40,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1909639889, now seen corresponding path program 1 times [2024-11-13 13:35:40,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:35:40,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103013519] [2024-11-13 13:35:40,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:40,722 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 13:35:40,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:35:40,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 13:35:40,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 13:35:42,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:42,499 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:35:42,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:35:53,459 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-13 13:35:53,459 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:35:57,270 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-13 13:35:57,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103013519] [2024-11-13 13:35:57,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103013519] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:35:57,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640092194] [2024-11-13 13:35:57,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:35:57,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:35:57,272 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:35:57,275 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:35:57,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:35:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:35:58,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-13 13:35:58,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:36:06,733 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 303 proven. 72 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-13 13:36:06,733 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:36:09,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640092194] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:36:09,096 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-13 13:36:09,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2024-11-13 13:36:09,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584362211] [2024-11-13 13:36:09,098 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-13 13:36:09,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:36:09,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-13 13:36:09,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:36:09,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2024-11-13 13:36:09,101 INFO L87 Difference]: Start difference. First operand 69 states and 106 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 13:36:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-13 13:36:14,101 INFO L93 Difference]: Finished difference Result 212 states and 321 transitions. [2024-11-13 13:36:14,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-13 13:36:14,102 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 130 [2024-11-13 13:36:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-13 13:36:14,107 INFO L225 Difference]: With dead ends: 212 [2024-11-13 13:36:14,107 INFO L226 Difference]: Without dead ends: 146 [2024-11-13 13:36:14,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 433 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=210, Invalid=390, Unknown=0, NotChecked=0, Total=600 [2024-11-13 13:36:14,110 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 128 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-13 13:36:14,111 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 415 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-13 13:36:14,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-13 13:36:14,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 113. [2024-11-13 13:36:14,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 70 states have internal predecessors, (90), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-13 13:36:14,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2024-11-13 13:36:14,139 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 130 [2024-11-13 13:36:14,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-13 13:36:14,139 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2024-11-13 13:36:14,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 8 states have internal predecessors, (47), 3 states have call successors, (19), 3 states have call predecessors, (19), 4 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2024-11-13 13:36:14,140 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2024-11-13 13:36:14,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-13 13:36:14,141 INFO L207 NwaCegarLoop]: Found error trace [2024-11-13 13:36:14,141 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:36:14,168 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 13:36:14,405 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:36:14,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:36:14,542 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-13 13:36:14,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:36:14,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1091991439, now seen corresponding path program 1 times [2024-11-13 13:36:14,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-13 13:36:14,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045339091] [2024-11-13 13:36:14,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:36:14,544 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 13:36:14,544 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/bin/uautomizer-verify-qhAvR1uOyd/mathsat [2024-11-13 13:36:14,549 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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 13:36:14,551 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5177563-d3a2-4f49-98ad-70adbc0f6019/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)] Waiting until timeout for monitored process [2024-11-13 13:36:16,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:36:16,174 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-13 13:36:16,179 INFO L278 TraceCheckSpWp]: Computing forward predicates...