./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU --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 4b12f47b6a9e6367516ff056d37b273ff79ef947ae35a3f55eb64f05e3d00fe1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:13:58,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:13:58,146 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:13:58,153 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:13:58,156 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:13:58,192 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:13:58,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:13:58,193 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:13:58,195 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:13:58,196 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:13:58,197 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:13:58,197 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:13:58,198 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:13:58,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:13:58,200 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:13:58,201 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:13:58,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:13:58,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:13:58,202 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:13:58,202 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:13:58,202 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:13:58,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:13:58,207 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:13:58,207 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:13:58,207 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:13:58,208 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:13:58,208 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:13:58,208 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:13:58,209 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:13:58,209 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:13:58,210 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:13:58,210 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:13:58,212 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:58,212 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:13:58,212 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:13:58,213 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:13:58,213 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:13:58,213 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:13:58,213 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:13:58,214 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:13:58,214 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:13:58,214 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:13:58,214 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU 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 -> 4b12f47b6a9e6367516ff056d37b273ff79ef947ae35a3f55eb64f05e3d00fe1 [2024-10-31 22:13:58,465 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:13:58,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:13:58,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:13:58,501 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:13:58,501 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:13:58,503 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-2.i Unable to find full path for "g++" [2024-10-31 22:14:00,666 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:14:00,998 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:14:00,999 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-2.i [2024-10-31 22:14:01,008 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/data/0d474895d/2322e09a27524a22aa7cb127ed297330/FLAGe80b2a5bc [2024-10-31 22:14:01,255 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/data/0d474895d/2322e09a27524a22aa7cb127ed297330 [2024-10-31 22:14:01,258 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:14:01,259 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:14:01,266 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:14:01,266 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:14:01,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:14:01,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,280 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e717fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01, skipping insertion in model container [2024-10-31 22:14:01,281 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:14:01,520 WARN L251 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_a5feb0be-b4c2-4ed5-a94c-152249f0de77/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-2.i[915,928] [2024-10-31 22:14:01,592 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:14:01,607 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:14:01,621 WARN L251 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_a5feb0be-b4c2-4ed5-a94c-152249f0de77/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-2.i[915,928] [2024-10-31 22:14:01,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:14:01,693 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:14:01,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01 WrapperNode [2024-10-31 22:14:01,694 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:14:01,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:14:01,697 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:14:01,697 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:14:01,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,718 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,778 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2024-10-31 22:14:01,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:14:01,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:14:01,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:14:01,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:14:01,796 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,832 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-10-31 22:14:01,832 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,832 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,843 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,854 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,856 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,858 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,865 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:14:01,870 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:14:01,870 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:14:01,870 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:14:01,871 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (1/1) ... [2024-10-31 22:14:01,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:14:01,895 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:14:01,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:14:01,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:14:01,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:14:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:14:01,955 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:14:01,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:14:01,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:14:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:14:02,052 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:14:02,056 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:14:02,488 INFO L? ?]: Removed 11 outVars from TransFormulas that were not future-live. [2024-10-31 22:14:02,488 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:14:02,504 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:14:02,504 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:14:02,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:14:02 BoogieIcfgContainer [2024-10-31 22:14:02,505 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:14:02,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:14:02,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:14:02,511 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:14:02,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:14:01" (1/3) ... [2024-10-31 22:14:02,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5622d144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:14:02, skipping insertion in model container [2024-10-31 22:14:02,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:14:01" (2/3) ... [2024-10-31 22:14:02,513 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5622d144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:14:02, skipping insertion in model container [2024-10-31 22:14:02,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:14:02" (3/3) ... [2024-10-31 22:14:02,514 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-2.i [2024-10-31 22:14:02,530 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:14:02,531 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:14:02,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:14:02,614 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;@1a331ca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:14:02,614 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:14:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:14:02,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-31 22:14:02,630 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:02,631 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:02,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:02,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:02,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1183447063, now seen corresponding path program 1 times [2024-10-31 22:14:02,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:02,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444171193] [2024-10-31 22:14:02,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:02,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:02,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:04,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:04,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:04,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:04,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:04,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:04,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:04,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:04,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:04,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444171193] [2024-10-31 22:14:04,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444171193] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:04,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:04,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:14:04,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415538283] [2024-10-31 22:14:04,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:04,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:14:04,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:04,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:14:04,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:14:04,825 INFO L87 Difference]: Start difference. First operand has 55 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:06,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:06,230 INFO L93 Difference]: Finished difference Result 120 states and 199 transitions. [2024-10-31 22:14:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:14:06,234 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-10-31 22:14:06,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:06,246 INFO L225 Difference]: With dead ends: 120 [2024-10-31 22:14:06,247 INFO L226 Difference]: Without dead ends: 68 [2024-10-31 22:14:06,252 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:14:06,256 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 22 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:06,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 151 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-31 22:14:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-31 22:14:06,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 57. [2024-10-31 22:14:06,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 41 states have internal predecessors, (55), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:14:06,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 83 transitions. [2024-10-31 22:14:06,301 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 83 transitions. Word has length 91 [2024-10-31 22:14:06,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:06,303 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 83 transitions. [2024-10-31 22:14:06,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:06,304 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2024-10-31 22:14:06,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-10-31 22:14:06,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:06,307 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:06,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:14:06,308 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:06,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:06,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1863505433, now seen corresponding path program 1 times [2024-10-31 22:14:06,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:06,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347391991] [2024-10-31 22:14:06,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:06,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:06,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:06,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:06,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:06,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:06,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:06,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:06,996 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:06,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:06,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347391991] [2024-10-31 22:14:06,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347391991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:06,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:06,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:14:06,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612720443] [2024-10-31 22:14:06,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:06,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:14:06,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:06,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:14:07,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:14:07,000 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:07,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:07,727 INFO L93 Difference]: Finished difference Result 112 states and 164 transitions. [2024-10-31 22:14:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:14:07,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 91 [2024-10-31 22:14:07,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:07,731 INFO L225 Difference]: With dead ends: 112 [2024-10-31 22:14:07,732 INFO L226 Difference]: Without dead ends: 58 [2024-10-31 22:14:07,732 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:14:07,734 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:07,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 132 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-31 22:14:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-31 22:14:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2024-10-31 22:14:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:14:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 69 transitions. [2024-10-31 22:14:07,748 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 69 transitions. Word has length 91 [2024-10-31 22:14:07,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:07,749 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 69 transitions. [2024-10-31 22:14:07,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:07,749 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 69 transitions. [2024-10-31 22:14:07,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-31 22:14:07,754 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:07,754 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:07,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:14:07,755 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:07,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:07,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1041134376, now seen corresponding path program 1 times [2024-10-31 22:14:07,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:07,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575693619] [2024-10-31 22:14:07,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:07,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:08,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:08,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:08,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:08,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:08,998 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:09,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:09,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575693619] [2024-10-31 22:14:09,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575693619] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:09,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:14:09,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762142256] [2024-10-31 22:14:09,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:09,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:14:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:09,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:14:09,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:14:09,004 INFO L87 Difference]: Start difference. First operand 49 states and 69 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:09,459 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2024-10-31 22:14:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:14:09,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 93 [2024-10-31 22:14:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:09,462 INFO L225 Difference]: With dead ends: 99 [2024-10-31 22:14:09,463 INFO L226 Difference]: Without dead ends: 97 [2024-10-31 22:14:09,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:14:09,464 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 63 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:09,465 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 346 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:14:09,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-31 22:14:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 76. [2024-10-31 22:14:09,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.2280701754385965) internal successors, (70), 58 states have internal predecessors, (70), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:14:09,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 102 transitions. [2024-10-31 22:14:09,488 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 102 transitions. Word has length 93 [2024-10-31 22:14:09,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:09,489 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 102 transitions. [2024-10-31 22:14:09,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:09,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 102 transitions. [2024-10-31 22:14:09,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-31 22:14:09,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:09,495 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:09,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:14:09,495 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -392309796, now seen corresponding path program 1 times [2024-10-31 22:14:09,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:09,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395792256] [2024-10-31 22:14:09,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:09,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:11,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:11,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:11,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:11,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:11,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:11,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:11,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:11,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:11,109 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:11,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:11,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395792256] [2024-10-31 22:14:11,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395792256] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:11,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:11,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:14:11,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607229220] [2024-10-31 22:14:11,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:11,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:14:11,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:11,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:14:11,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:14:11,112 INFO L87 Difference]: Start difference. First operand 76 states and 102 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:11,902 INFO L93 Difference]: Finished difference Result 128 states and 156 transitions. [2024-10-31 22:14:11,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:14:11,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 94 [2024-10-31 22:14:11,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:11,905 INFO L225 Difference]: With dead ends: 128 [2024-10-31 22:14:11,905 INFO L226 Difference]: Without dead ends: 126 [2024-10-31 22:14:11,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:14:11,907 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 84 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:11,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 373 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:14:11,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-10-31 22:14:11,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 73. [2024-10-31 22:14:11,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 55 states have internal predecessors, (66), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:14:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2024-10-31 22:14:11,920 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 94 [2024-10-31 22:14:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:11,921 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2024-10-31 22:14:11,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2024-10-31 22:14:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-31 22:14:11,922 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:11,923 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:11,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:14:11,923 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:11,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:11,924 INFO L85 PathProgramCache]: Analyzing trace with hash -77801971, now seen corresponding path program 1 times [2024-10-31 22:14:11,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:11,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136943341] [2024-10-31 22:14:11,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:11,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:12,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:12,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:12,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:12,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:12,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:12,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,044 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:12,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:12,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136943341] [2024-10-31 22:14:12,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136943341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:12,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:12,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:14:12,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783765758] [2024-10-31 22:14:12,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:12,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:12,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:12,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:12,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:12,047 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:12,109 INFO L93 Difference]: Finished difference Result 153 states and 203 transitions. [2024-10-31 22:14:12,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:12,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-10-31 22:14:12,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:12,112 INFO L225 Difference]: With dead ends: 153 [2024-10-31 22:14:12,113 INFO L226 Difference]: Without dead ends: 83 [2024-10-31 22:14:12,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-10-31 22:14:12,115 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 20 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:12,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 121 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:14:12,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-31 22:14:12,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2024-10-31 22:14:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 53 states have internal predecessors, (63), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-31 22:14:12,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 95 transitions. [2024-10-31 22:14:12,127 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 95 transitions. Word has length 95 [2024-10-31 22:14:12,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:12,128 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 95 transitions. [2024-10-31 22:14:12,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:12,128 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 95 transitions. [2024-10-31 22:14:12,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-31 22:14:12,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:12,130 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:12,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:14:12,130 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:12,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:12,131 INFO L85 PathProgramCache]: Analyzing trace with hash 528737550, now seen corresponding path program 1 times [2024-10-31 22:14:12,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:12,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365738915] [2024-10-31 22:14:12,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:12,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:12,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:12,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:12,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:12,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:12,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:12,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:12,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:12,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:12,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365738915] [2024-10-31 22:14:12,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365738915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:12,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:12,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:14:12,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997727968] [2024-10-31 22:14:12,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:12,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:14:12,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:12,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:14:12,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:14:12,237 INFO L87 Difference]: Start difference. First operand 71 states and 95 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:12,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:12,294 INFO L93 Difference]: Finished difference Result 140 states and 186 transitions. [2024-10-31 22:14:12,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:14:12,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2024-10-31 22:14:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:12,296 INFO L225 Difference]: With dead ends: 140 [2024-10-31 22:14:12,297 INFO L226 Difference]: Without dead ends: 72 [2024-10-31 22:14:12,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-10-31 22:14:12,298 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 27 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:12,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 111 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:14:12,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-31 22:14:12,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 62. [2024-10-31 22:14:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.2) internal successors, (54), 45 states have internal predecessors, (54), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:14:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2024-10-31 22:14:12,310 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 95 [2024-10-31 22:14:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:12,311 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2024-10-31 22:14:12,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2024-10-31 22:14:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-10-31 22:14:12,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:12,312 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:12,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:14:12,313 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:12,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:12,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1430087283, now seen corresponding path program 1 times [2024-10-31 22:14:12,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:12,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20092074] [2024-10-31 22:14:12,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:12,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:13,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:13,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:13,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:13,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:14,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:14,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:14,004 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:14,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:14,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20092074] [2024-10-31 22:14:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20092074] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:14,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:14,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:14:14,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272265409] [2024-10-31 22:14:14,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:14,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:14:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:14,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:14:14,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:14:14,007 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:14,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:14,629 INFO L93 Difference]: Finished difference Result 106 states and 130 transitions. [2024-10-31 22:14:14,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:14:14,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 97 [2024-10-31 22:14:14,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:14,632 INFO L225 Difference]: With dead ends: 106 [2024-10-31 22:14:14,632 INFO L226 Difference]: Without dead ends: 104 [2024-10-31 22:14:14,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-10-31 22:14:14,633 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 39 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:14,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 520 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:14:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-31 22:14:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 69. [2024-10-31 22:14:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:14:14,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-10-31 22:14:14,648 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 97 [2024-10-31 22:14:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:14,649 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-10-31 22:14:14,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-10-31 22:14:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:14:14,651 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:14,651 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:14,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:14:14,651 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:14,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:14,652 INFO L85 PathProgramCache]: Analyzing trace with hash 566777371, now seen corresponding path program 1 times [2024-10-31 22:14:14,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:14,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604074946] [2024-10-31 22:14:14,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:14,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:14,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:16,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:16,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:16,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:16,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:16,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:16,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:16,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:16,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:16,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604074946] [2024-10-31 22:14:16,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604074946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:16,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:16,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:14:16,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835946349] [2024-10-31 22:14:16,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:16,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:14:16,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:16,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:14:16,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:14:16,237 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:16,900 INFO L93 Difference]: Finished difference Result 123 states and 148 transitions. [2024-10-31 22:14:16,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:14:16,901 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-10-31 22:14:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:16,902 INFO L225 Difference]: With dead ends: 123 [2024-10-31 22:14:16,902 INFO L226 Difference]: Without dead ends: 121 [2024-10-31 22:14:16,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:14:16,903 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 57 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:16,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 580 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:14:16,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-31 22:14:16,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 69. [2024-10-31 22:14:16,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:14:16,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-10-31 22:14:16,927 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 98 [2024-10-31 22:14:16,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:16,928 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-10-31 22:14:16,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:16,928 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-10-31 22:14:16,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:14:16,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:16,930 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:16,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:14:16,931 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:16,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:16,932 INFO L85 PathProgramCache]: Analyzing trace with hash 970186596, now seen corresponding path program 1 times [2024-10-31 22:14:16,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:16,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878154713] [2024-10-31 22:14:16,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:16,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:18,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:18,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:18,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:18,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:18,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:18,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:18,217 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:18,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:18,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878154713] [2024-10-31 22:14:18,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878154713] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:18,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:18,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:14:18,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236605667] [2024-10-31 22:14:18,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:18,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:14:18,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:18,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:14:18,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:14:18,220 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:18,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:18,829 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2024-10-31 22:14:18,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:14:18,830 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2024-10-31 22:14:18,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:18,831 INFO L225 Difference]: With dead ends: 93 [2024-10-31 22:14:18,831 INFO L226 Difference]: Without dead ends: 91 [2024-10-31 22:14:18,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-10-31 22:14:18,832 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 41 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:18,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 530 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:14:18,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-31 22:14:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2024-10-31 22:14:18,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-31 22:14:18,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 91 transitions. [2024-10-31 22:14:18,845 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 91 transitions. Word has length 98 [2024-10-31 22:14:18,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:18,845 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 91 transitions. [2024-10-31 22:14:18,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 91 transitions. [2024-10-31 22:14:18,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-31 22:14:18,847 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:14:18,847 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:14:18,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:14:18,847 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:14:18,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:14:18,848 INFO L85 PathProgramCache]: Analyzing trace with hash -805242038, now seen corresponding path program 1 times [2024-10-31 22:14:18,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:14:18,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028243001] [2024-10-31 22:14:18,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:14:18,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:14:18,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:14:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:14:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:14:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:14:20,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:14:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:14:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:14:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:14:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:14:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:14:20,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:14:20,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:14:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-31 22:14:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:14:20,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:14:20,099 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-31 22:14:20,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:14:20,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028243001] [2024-10-31 22:14:20,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028243001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:14:20,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:14:20,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-31 22:14:20,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403707793] [2024-10-31 22:14:20,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:14:20,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-31 22:14:20,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:14:20,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-31 22:14:20,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:14:20,109 INFO L87 Difference]: Start difference. First operand 69 states and 91 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:20,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:14:20,747 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2024-10-31 22:14:20,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-31 22:14:20,748 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 99 [2024-10-31 22:14:20,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:14:20,748 INFO L225 Difference]: With dead ends: 103 [2024-10-31 22:14:20,749 INFO L226 Difference]: Without dead ends: 0 [2024-10-31 22:14:20,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-10-31 22:14:20,750 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 41 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:14:20,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 564 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:14:20,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-31 22:14:20,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-31 22:14:20,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:14:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-31 22:14:20,753 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2024-10-31 22:14:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:14:20,753 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-31 22:14:20,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-31 22:14:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-31 22:14:20,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-31 22:14:20,756 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:14:20,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:14:20,760 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:14:20,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-31 22:14:23,311 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:14:23,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:14:23 BoogieIcfgContainer [2024-10-31 22:14:23,331 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:14:23,331 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:14:23,332 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:14:23,332 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:14:23,332 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:14:02" (3/4) ... [2024-10-31 22:14:23,335 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-10-31 22:14:23,339 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-10-31 22:14:23,347 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-31 22:14:23,347 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-31 22:14:23,347 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-31 22:14:23,348 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-31 22:14:23,453 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/witness.graphml [2024-10-31 22:14:23,456 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/witness.yml [2024-10-31 22:14:23,457 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:14:23,457 INFO L158 Benchmark]: Toolchain (without parser) took 22198.23ms. Allocated memory was 151.0MB in the beginning and 346.0MB in the end (delta: 195.0MB). Free memory was 118.6MB in the beginning and 144.6MB in the end (delta: -26.0MB). Peak memory consumption was 170.6MB. Max. memory is 16.1GB. [2024-10-31 22:14:23,458 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:14:23,458 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.00ms. Allocated memory is still 151.0MB. Free memory was 118.1MB in the beginning and 103.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:14:23,459 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.96ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 100.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:14:23,460 INFO L158 Benchmark]: Boogie Preprocessor took 86.07ms. Allocated memory is still 151.0MB. Free memory was 100.3MB in the beginning and 95.6MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:14:23,460 INFO L158 Benchmark]: RCFGBuilder took 635.13ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 76.2MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 22:14:23,461 INFO L158 Benchmark]: TraceAbstraction took 20823.79ms. Allocated memory was 151.0MB in the beginning and 346.0MB in the end (delta: 195.0MB). Free memory was 75.2MB in the beginning and 150.9MB in the end (delta: -75.7MB). Peak memory consumption was 165.1MB. Max. memory is 16.1GB. [2024-10-31 22:14:23,461 INFO L158 Benchmark]: Witness Printer took 125.30ms. Allocated memory is still 346.0MB. Free memory was 150.9MB in the beginning and 144.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-31 22:14:23,463 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 107.0MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.00ms. Allocated memory is still 151.0MB. Free memory was 118.1MB in the beginning and 103.9MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.96ms. Allocated memory is still 151.0MB. Free memory was 103.9MB in the beginning and 100.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.07ms. Allocated memory is still 151.0MB. Free memory was 100.3MB in the beginning and 95.6MB in the end (delta: 4.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 635.13ms. Allocated memory is still 151.0MB. Free memory was 95.6MB in the beginning and 76.2MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 20823.79ms. Allocated memory was 151.0MB in the beginning and 346.0MB in the end (delta: 195.0MB). Free memory was 75.2MB in the beginning and 150.9MB in the end (delta: -75.7MB). Peak memory consumption was 165.1MB. Max. memory is 16.1GB. * Witness Printer took 125.30ms. Allocated memory is still 346.0MB. Free memory was 150.9MB in the beginning and 144.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 18.2s, OverallIterations: 10, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 416 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 416 mSDsluCounter, 3428 SdHoareTripleChecker+Invalid, 3.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2698 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1707 IncrementalHoareTripleChecker+Invalid, 1727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 730 mSDtfsCounter, 1707 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 393 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=3, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 225 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.1s InterpolantComputationTime, 951 NumberOfCodeBlocks, 951 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 941 ConstructedInterpolants, 0 QuantifiedInterpolants, 3717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 3640/3640 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Ensures: (((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_5 == \old(var_1_5))) && (var_1_6 == \old(var_1_6))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (last_1_var_1_1 == \old(last_1_var_1_1))) && (last_1_var_1_9 == \old(last_1_var_1_9))) RESULT: Ultimate proved your program to be correct! [2024-10-31 22:14:23,501 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5feb0be-b4c2-4ed5-a94c-152249f0de77/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE