./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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 64bit --witnessprinter.graph.data.programhash 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:11:26,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:11:26,953 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-31 22:11:26,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:11:26,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:11:26,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:11:26,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:11:26,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:11:26,998 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:11:26,998 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:11:27,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:11:27,001 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:11:27,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:11:27,005 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:11:27,006 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:11:27,006 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:11:27,007 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:11:27,007 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:11:27,007 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:11:27,008 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:11:27,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:11:27,009 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:11:27,009 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:11:27,010 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:11:27,010 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:11:27,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:11:27,011 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:11:27,011 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:11:27,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:11:27,012 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:27,015 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:11:27,016 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:11:27,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:11:27,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:11:27,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:11:27,018 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:11:27,018 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:11:27,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:11:27,019 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:11:27,019 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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2024-10-31 22:11:27,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:11:27,322 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:11:27,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:11:27,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:11:27,327 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:11:27,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c Unable to find full path for "g++" [2024-10-31 22:11:29,524 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:11:29,759 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:11:29,764 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2024-10-31 22:11:29,780 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/data/29e552ff0/3bb364a8fefb4424bbe8286b0bc443fc/FLAGdfb5c0f38 [2024-10-31 22:11:29,798 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/data/29e552ff0/3bb364a8fefb4424bbe8286b0bc443fc [2024-10-31 22:11:29,803 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:11:29,805 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:11:29,806 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:29,806 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:11:29,812 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:11:29,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:29" (1/1) ... [2024-10-31 22:11:29,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@206cdd44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:29, skipping insertion in model container [2024-10-31 22:11:29,816 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:29" (1/1) ... [2024-10-31 22:11:29,875 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:11:30,092 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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2024-10-31 22:11:30,345 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:30,366 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:11:30,382 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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186] [2024-10-31 22:11:30,541 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:11:30,568 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:11:30,569 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30 WrapperNode [2024-10-31 22:11:30,569 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:30,571 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:30,571 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:11:30,571 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:11:30,579 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:11:30" (1/1) ... [2024-10-31 22:11:30,607 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:11:30" (1/1) ... [2024-10-31 22:11:30,882 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1645 [2024-10-31 22:11:30,882 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:11:30,883 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:11:30,883 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:11:30,884 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:11:30,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:30,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:30,927 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:30,972 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:11:30,972 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:30,972 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:31,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:31,045 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:31,067 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:31,086 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:31,117 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:11:31,118 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:11:31,118 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:11:31,119 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:11:31,120 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (1/1) ... [2024-10-31 22:11:31,126 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:31,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:11:31,160 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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:11:31,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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:11:31,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:11:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:11:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:11:31,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:11:31,460 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:11:31,463 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:11:34,193 INFO L? ?]: Removed 857 outVars from TransFormulas that were not future-live. [2024-10-31 22:11:34,194 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:11:34,222 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:11:34,222 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:11:34,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:34 BoogieIcfgContainer [2024-10-31 22:11:34,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:11:34,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:11:34,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:11:34,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:11:34,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:11:29" (1/3) ... [2024-10-31 22:11:34,231 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3070c99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:34, skipping insertion in model container [2024-10-31 22:11:34,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:30" (2/3) ... [2024-10-31 22:11:34,233 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3070c99b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:11:34, skipping insertion in model container [2024-10-31 22:11:34,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:34" (3/3) ... [2024-10-31 22:11:34,235 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.adding.2.prop1-func-interl.c [2024-10-31 22:11:34,255 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:11:34,255 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:11:34,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:11:34,371 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;@2cb4fdb1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:11:34,371 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:11:34,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 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:11:34,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-10-31 22:11:34,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:34,394 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:34,395 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:34,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1368434867, now seen corresponding path program 1 times [2024-10-31 22:11:34,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:34,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352293148] [2024-10-31 22:11:34,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:34,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:34,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:35,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:35,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:35,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352293148] [2024-10-31 22:11:35,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352293148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:35,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:35,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:35,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143478863] [2024-10-31 22:11:35,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:35,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:35,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:35,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:35,295 INFO L87 Difference]: Start difference. First operand has 597 states, 595 states have (on average 1.5025210084033613) internal successors, (894), 596 states have internal predecessors, (894), 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) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:11:35,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:35,452 INFO L93 Difference]: Finished difference Result 1149 states and 1724 transitions. [2024-10-31 22:11:35,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:35,456 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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) Word has length 59 [2024-10-31 22:11:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:35,477 INFO L225 Difference]: With dead ends: 1149 [2024-10-31 22:11:35,478 INFO L226 Difference]: Without dead ends: 594 [2024-10-31 22:11:35,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:35,495 INFO L432 NwaCegarLoop]: 882 mSDtfsCounter, 858 mSDsluCounter, 880 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 1762 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:35,502 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 1762 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2024-10-31 22:11:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2024-10-31 22:11:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 593 states have (on average 1.4991568296795952) internal successors, (889), 593 states have internal predecessors, (889), 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:11:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 889 transitions. [2024-10-31 22:11:35,678 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 889 transitions. Word has length 59 [2024-10-31 22:11:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:35,680 INFO L471 AbstractCegarLoop]: Abstraction has 594 states and 889 transitions. [2024-10-31 22:11:35,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 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:11:35,681 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 889 transitions. [2024-10-31 22:11:35,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-10-31 22:11:35,686 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:35,686 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:35,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:11:35,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:35,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:35,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1453492137, now seen corresponding path program 1 times [2024-10-31 22:11:35,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:35,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852760450] [2024-10-31 22:11:35,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:35,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:35,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:36,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:36,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852760450] [2024-10-31 22:11:36,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852760450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:36,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:36,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:36,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382946563] [2024-10-31 22:11:36,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:36,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:36,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:36,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:36,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:36,195 INFO L87 Difference]: Start difference. First operand 594 states and 889 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:11:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:36,240 INFO L93 Difference]: Finished difference Result 598 states and 893 transitions. [2024-10-31 22:11:36,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:36,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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) Word has length 60 [2024-10-31 22:11:36,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:36,244 INFO L225 Difference]: With dead ends: 598 [2024-10-31 22:11:36,244 INFO L226 Difference]: Without dead ends: 596 [2024-10-31 22:11:36,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:36,249 INFO L432 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1768 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2655 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:36,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2655 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2024-10-31 22:11:36,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2024-10-31 22:11:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.4974789915966387) internal successors, (891), 595 states have internal predecessors, (891), 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:11:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 891 transitions. [2024-10-31 22:11:36,289 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 891 transitions. Word has length 60 [2024-10-31 22:11:36,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:36,290 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 891 transitions. [2024-10-31 22:11:36,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 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:11:36,290 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 891 transitions. [2024-10-31 22:11:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-10-31 22:11:36,292 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:36,293 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:36,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:11:36,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:36,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:36,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2110278823, now seen corresponding path program 1 times [2024-10-31 22:11:36,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:36,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7279270] [2024-10-31 22:11:36,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:36,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:36,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:36,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7279270] [2024-10-31 22:11:36,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7279270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:36,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:36,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:36,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81833338] [2024-10-31 22:11:36,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:36,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:36,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:36,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:36,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:36,595 INFO L87 Difference]: Start difference. First operand 596 states and 891 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:11:36,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:36,647 INFO L93 Difference]: Finished difference Result 1152 states and 1723 transitions. [2024-10-31 22:11:36,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:36,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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) Word has length 61 [2024-10-31 22:11:36,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:36,650 INFO L225 Difference]: With dead ends: 1152 [2024-10-31 22:11:36,650 INFO L226 Difference]: Without dead ends: 598 [2024-10-31 22:11:36,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:36,653 INFO L432 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2651 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:36,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2651 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:36,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2024-10-31 22:11:36,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2024-10-31 22:11:36,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.4958123953098827) internal successors, (893), 597 states have internal predecessors, (893), 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:11:36,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 893 transitions. [2024-10-31 22:11:36,673 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 893 transitions. Word has length 61 [2024-10-31 22:11:36,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:36,674 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 893 transitions. [2024-10-31 22:11:36,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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:11:36,675 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 893 transitions. [2024-10-31 22:11:36,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-31 22:11:36,676 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:36,677 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:36,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:11:36,677 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:36,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:36,678 INFO L85 PathProgramCache]: Analyzing trace with hash -103831486, now seen corresponding path program 1 times [2024-10-31 22:11:36,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:36,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414366043] [2024-10-31 22:11:36,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:36,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:36,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:36,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414366043] [2024-10-31 22:11:36,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414366043] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:36,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:36,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:36,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62315853] [2024-10-31 22:11:36,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:36,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:36,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:36,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:36,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:36,913 INFO L87 Difference]: Start difference. First operand 598 states and 893 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:11:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:36,985 INFO L93 Difference]: Finished difference Result 1156 states and 1727 transitions. [2024-10-31 22:11:36,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:36,986 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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) Word has length 62 [2024-10-31 22:11:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:36,988 INFO L225 Difference]: With dead ends: 1156 [2024-10-31 22:11:36,989 INFO L226 Difference]: Without dead ends: 600 [2024-10-31 22:11:36,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:36,996 INFO L432 NwaCegarLoop]: 887 mSDtfsCounter, 0 mSDsluCounter, 1758 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2645 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:36,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2645 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:37,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-10-31 22:11:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-10-31 22:11:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4941569282136895) internal successors, (895), 599 states have internal predecessors, (895), 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:11:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 895 transitions. [2024-10-31 22:11:37,014 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 895 transitions. Word has length 62 [2024-10-31 22:11:37,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:37,016 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 895 transitions. [2024-10-31 22:11:37,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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:11:37,016 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 895 transitions. [2024-10-31 22:11:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2024-10-31 22:11:37,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:37,018 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:37,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:11:37,018 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:37,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:37,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1985078414, now seen corresponding path program 1 times [2024-10-31 22:11:37,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:37,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202526519] [2024-10-31 22:11:37,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:37,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:37,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:37,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202526519] [2024-10-31 22:11:37,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202526519] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:37,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:37,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764699694] [2024-10-31 22:11:37,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:37,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:37,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:37,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:37,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:37,357 INFO L87 Difference]: Start difference. First operand 600 states and 895 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:11:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:37,430 INFO L93 Difference]: Finished difference Result 1162 states and 1734 transitions. [2024-10-31 22:11:37,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:37,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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) Word has length 63 [2024-10-31 22:11:37,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:37,433 INFO L225 Difference]: With dead ends: 1162 [2024-10-31 22:11:37,433 INFO L226 Difference]: Without dead ends: 604 [2024-10-31 22:11:37,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:37,437 INFO L432 NwaCegarLoop]: 881 mSDtfsCounter, 4 mSDsluCounter, 2634 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 3515 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:37,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 3515 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2024-10-31 22:11:37,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 602. [2024-10-31 22:11:37,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 601 states have (on average 1.4925124792013311) internal successors, (897), 601 states have internal predecessors, (897), 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:11:37,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 897 transitions. [2024-10-31 22:11:37,454 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 897 transitions. Word has length 63 [2024-10-31 22:11:37,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:37,454 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 897 transitions. [2024-10-31 22:11:37,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 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:11:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 897 transitions. [2024-10-31 22:11:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-31 22:11:37,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:37,457 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:37,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:11:37,457 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:37,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:37,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1793926481, now seen corresponding path program 1 times [2024-10-31 22:11:37,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:37,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087560489] [2024-10-31 22:11:37,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:37,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:37,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:37,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087560489] [2024-10-31 22:11:37,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087560489] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:37,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:37,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:37,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404060066] [2024-10-31 22:11:37,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:37,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:37,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:37,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:37,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:37,692 INFO L87 Difference]: Start difference. First operand 602 states and 897 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:11:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:37,750 INFO L93 Difference]: Finished difference Result 1189 states and 1772 transitions. [2024-10-31 22:11:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:37,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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) Word has length 64 [2024-10-31 22:11:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:37,755 INFO L225 Difference]: With dead ends: 1189 [2024-10-31 22:11:37,755 INFO L226 Difference]: Without dead ends: 629 [2024-10-31 22:11:37,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:37,759 INFO L432 NwaCegarLoop]: 886 mSDtfsCounter, 64 mSDsluCounter, 2590 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 3476 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:37,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 3476 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:37,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-10-31 22:11:37,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2024-10-31 22:11:37,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 629 states, 628 states have (on average 1.4904458598726114) internal successors, (936), 628 states have internal predecessors, (936), 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:11:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 936 transitions. [2024-10-31 22:11:37,778 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 936 transitions. Word has length 64 [2024-10-31 22:11:37,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:37,779 INFO L471 AbstractCegarLoop]: Abstraction has 629 states and 936 transitions. [2024-10-31 22:11:37,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 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:11:37,779 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 936 transitions. [2024-10-31 22:11:37,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-31 22:11:37,781 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:37,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:37,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:11:37,782 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:37,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:37,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1882603606, now seen corresponding path program 1 times [2024-10-31 22:11:37,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:37,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451595699] [2024-10-31 22:11:37,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:37,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:37,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:38,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:38,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:38,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451595699] [2024-10-31 22:11:38,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451595699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:38,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:38,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:11:38,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346074421] [2024-10-31 22:11:38,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:38,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:38,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:38,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:38,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:38,291 INFO L87 Difference]: Start difference. First operand 629 states and 936 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:11:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:38,582 INFO L93 Difference]: Finished difference Result 1196 states and 1785 transitions. [2024-10-31 22:11:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:38,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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) Word has length 64 [2024-10-31 22:11:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:38,585 INFO L225 Difference]: With dead ends: 1196 [2024-10-31 22:11:38,585 INFO L226 Difference]: Without dead ends: 636 [2024-10-31 22:11:38,586 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:38,588 INFO L432 NwaCegarLoop]: 840 mSDtfsCounter, 863 mSDsluCounter, 2499 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 863 SdHoareTripleChecker+Valid, 3339 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:38,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [863 Valid, 3339 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:38,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-31 22:11:38,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 633. [2024-10-31 22:11:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 633 states, 632 states have (on average 1.4873417721518987) internal successors, (940), 632 states have internal predecessors, (940), 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:11:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 940 transitions. [2024-10-31 22:11:38,607 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 940 transitions. Word has length 64 [2024-10-31 22:11:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:38,608 INFO L471 AbstractCegarLoop]: Abstraction has 633 states and 940 transitions. [2024-10-31 22:11:38,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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:11:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 940 transitions. [2024-10-31 22:11:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-31 22:11:38,609 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:38,609 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:38,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:11:38,610 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:38,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:38,610 INFO L85 PathProgramCache]: Analyzing trace with hash -353009811, now seen corresponding path program 1 times [2024-10-31 22:11:38,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:38,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950704845] [2024-10-31 22:11:38,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:38,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:38,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:38,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:38,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950704845] [2024-10-31 22:11:38,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950704845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:38,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:38,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:38,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28110094] [2024-10-31 22:11:38,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:38,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:38,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:38,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:38,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:38,826 INFO L87 Difference]: Start difference. First operand 633 states and 940 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:11:38,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:38,982 INFO L93 Difference]: Finished difference Result 1203 states and 1789 transitions. [2024-10-31 22:11:38,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:38,982 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) Word has length 65 [2024-10-31 22:11:38,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:38,985 INFO L225 Difference]: With dead ends: 1203 [2024-10-31 22:11:38,985 INFO L226 Difference]: Without dead ends: 636 [2024-10-31 22:11:38,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:38,988 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 847 mSDsluCounter, 839 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 1690 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:38,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 1690 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2024-10-31 22:11:39,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 636. [2024-10-31 22:11:39,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.48503937007874) internal successors, (943), 635 states have internal predecessors, (943), 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:11:39,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 943 transitions. [2024-10-31 22:11:39,007 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 943 transitions. Word has length 65 [2024-10-31 22:11:39,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:39,007 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 943 transitions. [2024-10-31 22:11:39,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:11:39,008 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 943 transitions. [2024-10-31 22:11:39,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-31 22:11:39,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:39,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:39,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:11:39,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:39,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:39,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1064191121, now seen corresponding path program 1 times [2024-10-31 22:11:39,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:39,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875947426] [2024-10-31 22:11:39,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:39,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:39,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:39,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875947426] [2024-10-31 22:11:39,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875947426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:39,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:39,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:39,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604648767] [2024-10-31 22:11:39,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:39,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:39,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:39,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:39,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:39,182 INFO L87 Difference]: Start difference. First operand 636 states and 943 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:11:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:39,227 INFO L93 Difference]: Finished difference Result 1202 states and 1784 transitions. [2024-10-31 22:11:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:39,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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) Word has length 65 [2024-10-31 22:11:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:39,231 INFO L225 Difference]: With dead ends: 1202 [2024-10-31 22:11:39,231 INFO L226 Difference]: Without dead ends: 635 [2024-10-31 22:11:39,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:39,236 INFO L432 NwaCegarLoop]: 875 mSDtfsCounter, 844 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1749 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:39,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1749 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:11:39,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2024-10-31 22:11:39,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2024-10-31 22:11:39,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 634 states have (on average 1.4842271293375395) internal successors, (941), 634 states have internal predecessors, (941), 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:11:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 941 transitions. [2024-10-31 22:11:39,284 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 941 transitions. Word has length 65 [2024-10-31 22:11:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:39,284 INFO L471 AbstractCegarLoop]: Abstraction has 635 states and 941 transitions. [2024-10-31 22:11:39,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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:11:39,285 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 941 transitions. [2024-10-31 22:11:39,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-31 22:11:39,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:39,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:39,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:11:39,288 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:39,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:39,293 INFO L85 PathProgramCache]: Analyzing trace with hash 348639918, now seen corresponding path program 1 times [2024-10-31 22:11:39,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:39,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137893164] [2024-10-31 22:11:39,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:39,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:39,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:39,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137893164] [2024-10-31 22:11:39,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137893164] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:39,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:39,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:11:39,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312121552] [2024-10-31 22:11:39,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:39,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:11:39,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:39,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:11:39,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:39,594 INFO L87 Difference]: Start difference. First operand 635 states and 941 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:11:39,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:39,752 INFO L93 Difference]: Finished difference Result 1205 states and 1787 transitions. [2024-10-31 22:11:39,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:39,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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) Word has length 66 [2024-10-31 22:11:39,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:39,755 INFO L225 Difference]: With dead ends: 1205 [2024-10-31 22:11:39,755 INFO L226 Difference]: Without dead ends: 639 [2024-10-31 22:11:39,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:39,757 INFO L432 NwaCegarLoop]: 868 mSDtfsCounter, 9 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 4305 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:39,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 4305 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2024-10-31 22:11:39,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2024-10-31 22:11:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 636 states, 635 states have (on average 1.4834645669291338) internal successors, (942), 635 states have internal predecessors, (942), 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:11:39,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 942 transitions. [2024-10-31 22:11:39,773 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 942 transitions. Word has length 66 [2024-10-31 22:11:39,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:39,773 INFO L471 AbstractCegarLoop]: Abstraction has 636 states and 942 transitions. [2024-10-31 22:11:39,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 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:11:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 942 transitions. [2024-10-31 22:11:39,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-31 22:11:39,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:39,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:39,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:11:39,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:39,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:39,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1969752466, now seen corresponding path program 1 times [2024-10-31 22:11:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:39,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289571839] [2024-10-31 22:11:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:40,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:40,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289571839] [2024-10-31 22:11:40,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289571839] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:40,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:40,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:11:40,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315167711] [2024-10-31 22:11:40,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:40,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:11:40,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:40,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:11:40,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:11:40,475 INFO L87 Difference]: Start difference. First operand 636 states and 942 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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:11:40,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:40,827 INFO L93 Difference]: Finished difference Result 1214 states and 1798 transitions. [2024-10-31 22:11:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:11:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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) Word has length 66 [2024-10-31 22:11:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:40,830 INFO L225 Difference]: With dead ends: 1214 [2024-10-31 22:11:40,830 INFO L226 Difference]: Without dead ends: 647 [2024-10-31 22:11:40,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:11:40,832 INFO L432 NwaCegarLoop]: 859 mSDtfsCounter, 870 mSDsluCounter, 5084 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 5943 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:40,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 5943 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:40,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2024-10-31 22:11:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 643. [2024-10-31 22:11:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 642 states have (on average 1.4781931464174456) internal successors, (949), 642 states have internal predecessors, (949), 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:11:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 949 transitions. [2024-10-31 22:11:40,851 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 949 transitions. Word has length 66 [2024-10-31 22:11:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:40,851 INFO L471 AbstractCegarLoop]: Abstraction has 643 states and 949 transitions. [2024-10-31 22:11:40,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 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:11:40,851 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 949 transitions. [2024-10-31 22:11:40,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-31 22:11:40,852 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:40,852 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:40,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:11:40,853 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:40,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:40,853 INFO L85 PathProgramCache]: Analyzing trace with hash 423924778, now seen corresponding path program 1 times [2024-10-31 22:11:40,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:40,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477175141] [2024-10-31 22:11:40,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:40,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:41,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:41,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477175141] [2024-10-31 22:11:41,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477175141] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:41,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:41,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:11:41,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171463625] [2024-10-31 22:11:41,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:41,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:11:41,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:41,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:11:41,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:11:41,498 INFO L87 Difference]: Start difference. First operand 643 states and 949 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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:11:41,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:41,886 INFO L93 Difference]: Finished difference Result 1227 states and 1811 transitions. [2024-10-31 22:11:41,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:11:41,887 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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) Word has length 67 [2024-10-31 22:11:41,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:41,889 INFO L225 Difference]: With dead ends: 1227 [2024-10-31 22:11:41,889 INFO L226 Difference]: Without dead ends: 653 [2024-10-31 22:11:41,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:11:41,891 INFO L432 NwaCegarLoop]: 866 mSDtfsCounter, 870 mSDsluCounter, 5102 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 870 SdHoareTripleChecker+Valid, 5968 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:41,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [870 Valid, 5968 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:41,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-10-31 22:11:41,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 645. [2024-10-31 22:11:41,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.4782608695652173) internal successors, (952), 644 states have internal predecessors, (952), 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:11:41,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 952 transitions. [2024-10-31 22:11:41,908 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 952 transitions. Word has length 67 [2024-10-31 22:11:41,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:41,909 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 952 transitions. [2024-10-31 22:11:41,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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:11:41,909 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 952 transitions. [2024-10-31 22:11:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-31 22:11:41,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:41,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:41,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:11:41,912 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:41,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:41,912 INFO L85 PathProgramCache]: Analyzing trace with hash 565617738, now seen corresponding path program 1 times [2024-10-31 22:11:41,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:41,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622212652] [2024-10-31 22:11:41,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:41,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:42,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:42,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622212652] [2024-10-31 22:11:42,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622212652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:42,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:42,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:11:42,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213055475] [2024-10-31 22:11:42,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:42,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:11:42,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:42,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:11:42,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:42,234 INFO L87 Difference]: Start difference. First operand 645 states and 952 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:11:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:42,448 INFO L93 Difference]: Finished difference Result 1230 states and 1814 transitions. [2024-10-31 22:11:42,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:11:42,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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) Word has length 68 [2024-10-31 22:11:42,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:42,450 INFO L225 Difference]: With dead ends: 1230 [2024-10-31 22:11:42,451 INFO L226 Difference]: Without dead ends: 654 [2024-10-31 22:11:42,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:42,452 INFO L432 NwaCegarLoop]: 860 mSDtfsCounter, 6 mSDsluCounter, 5138 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5998 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:42,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5998 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:42,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-10-31 22:11:42,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 652. [2024-10-31 22:11:42,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 651 states have (on average 1.4746543778801844) internal successors, (960), 651 states have internal predecessors, (960), 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:11:42,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 960 transitions. [2024-10-31 22:11:42,467 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 960 transitions. Word has length 68 [2024-10-31 22:11:42,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:42,467 INFO L471 AbstractCegarLoop]: Abstraction has 652 states and 960 transitions. [2024-10-31 22:11:42,468 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 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:11:42,468 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 960 transitions. [2024-10-31 22:11:42,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-31 22:11:42,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:42,469 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:42,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:11:42,469 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:42,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:42,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1988327780, now seen corresponding path program 1 times [2024-10-31 22:11:42,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:42,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251026118] [2024-10-31 22:11:42,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:42,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:42,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:42,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:42,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251026118] [2024-10-31 22:11:42,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251026118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:42,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:42,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:11:42,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969697953] [2024-10-31 22:11:42,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:42,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:11:42,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:42,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:11:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:42,695 INFO L87 Difference]: Start difference. First operand 652 states and 960 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:11:43,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:43,731 INFO L93 Difference]: Finished difference Result 1760 states and 2592 transitions. [2024-10-31 22:11:43,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:43,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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) Word has length 68 [2024-10-31 22:11:43,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:43,736 INFO L225 Difference]: With dead ends: 1760 [2024-10-31 22:11:43,736 INFO L226 Difference]: Without dead ends: 1177 [2024-10-31 22:11:43,737 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:11:43,738 INFO L432 NwaCegarLoop]: 660 mSDtfsCounter, 797 mSDsluCounter, 1909 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:43,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 2569 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-31 22:11:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2024-10-31 22:11:43,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 702. [2024-10-31 22:11:43,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 702 states, 701 states have (on average 1.4593437945791725) internal successors, (1023), 701 states have internal predecessors, (1023), 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:11:43,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1023 transitions. [2024-10-31 22:11:43,760 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1023 transitions. Word has length 68 [2024-10-31 22:11:43,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:43,760 INFO L471 AbstractCegarLoop]: Abstraction has 702 states and 1023 transitions. [2024-10-31 22:11:43,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 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:11:43,760 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1023 transitions. [2024-10-31 22:11:43,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-31 22:11:43,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:43,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:43,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:11:43,762 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:43,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:43,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1189272367, now seen corresponding path program 1 times [2024-10-31 22:11:43,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:43,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735182641] [2024-10-31 22:11:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:43,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:44,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:44,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:44,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735182641] [2024-10-31 22:11:44,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735182641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:44,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:44,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:11:44,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342807450] [2024-10-31 22:11:44,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:44,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:11:44,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:44,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:11:44,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:44,201 INFO L87 Difference]: Start difference. First operand 702 states and 1023 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:11:44,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:44,316 INFO L93 Difference]: Finished difference Result 1296 states and 1896 transitions. [2024-10-31 22:11:44,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:44,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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) Word has length 69 [2024-10-31 22:11:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:44,319 INFO L225 Difference]: With dead ends: 1296 [2024-10-31 22:11:44,320 INFO L226 Difference]: Without dead ends: 713 [2024-10-31 22:11:44,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:11:44,323 INFO L432 NwaCegarLoop]: 878 mSDtfsCounter, 835 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 4362 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:44,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 4362 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2024-10-31 22:11:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 709. [2024-10-31 22:11:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 708 states have (on average 1.4576271186440677) internal successors, (1032), 708 states have internal predecessors, (1032), 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:11:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1032 transitions. [2024-10-31 22:11:44,338 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1032 transitions. Word has length 69 [2024-10-31 22:11:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:44,338 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1032 transitions. [2024-10-31 22:11:44,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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:11:44,339 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1032 transitions. [2024-10-31 22:11:44,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-31 22:11:44,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:44,340 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:44,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:11:44,340 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:44,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 977059328, now seen corresponding path program 1 times [2024-10-31 22:11:44,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:44,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934981925] [2024-10-31 22:11:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:44,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:44,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:44,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934981925] [2024-10-31 22:11:44,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934981925] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:44,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:44,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:11:44,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309445449] [2024-10-31 22:11:44,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:44,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:11:44,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:44,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:11:44,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:11:44,759 INFO L87 Difference]: Start difference. First operand 709 states and 1032 transitions. Second operand has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:11:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:45,289 INFO L93 Difference]: Finished difference Result 1331 states and 1949 transitions. [2024-10-31 22:11:45,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:11:45,290 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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) Word has length 70 [2024-10-31 22:11:45,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:45,292 INFO L225 Difference]: With dead ends: 1331 [2024-10-31 22:11:45,293 INFO L226 Difference]: Without dead ends: 725 [2024-10-31 22:11:45,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2024-10-31 22:11:45,295 INFO L432 NwaCegarLoop]: 835 mSDtfsCounter, 845 mSDsluCounter, 4130 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 4965 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:45,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 4965 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:11:45,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 725 states. [2024-10-31 22:11:45,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 725 to 725. [2024-10-31 22:11:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 725 states, 724 states have (on average 1.4530386740331491) internal successors, (1052), 724 states have internal predecessors, (1052), 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:11:45,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 725 states to 725 states and 1052 transitions. [2024-10-31 22:11:45,317 INFO L78 Accepts]: Start accepts. Automaton has 725 states and 1052 transitions. Word has length 70 [2024-10-31 22:11:45,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:45,318 INFO L471 AbstractCegarLoop]: Abstraction has 725 states and 1052 transitions. [2024-10-31 22:11:45,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.777777777777778) internal successors, (70), 9 states have internal predecessors, (70), 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:11:45,318 INFO L276 IsEmpty]: Start isEmpty. Operand 725 states and 1052 transitions. [2024-10-31 22:11:45,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-31 22:11:45,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:45,320 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:45,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 22:11:45,320 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:45,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:45,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1977496067, now seen corresponding path program 1 times [2024-10-31 22:11:45,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:45,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50414276] [2024-10-31 22:11:45,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:45,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:45,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:45,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:45,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50414276] [2024-10-31 22:11:45,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50414276] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:45,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:45,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:11:45,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93676348] [2024-10-31 22:11:45,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:45,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:11:45,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:45,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:11:45,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:45,696 INFO L87 Difference]: Start difference. First operand 725 states and 1052 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:11:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:46,230 INFO L93 Difference]: Finished difference Result 1359 states and 1976 transitions. [2024-10-31 22:11:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:11:46,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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) Word has length 71 [2024-10-31 22:11:46,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:46,233 INFO L225 Difference]: With dead ends: 1359 [2024-10-31 22:11:46,234 INFO L226 Difference]: Without dead ends: 735 [2024-10-31 22:11:46,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:11:46,236 INFO L432 NwaCegarLoop]: 832 mSDtfsCounter, 873 mSDsluCounter, 4146 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 873 SdHoareTripleChecker+Valid, 4978 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:46,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [873 Valid, 4978 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:46,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-31 22:11:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 728. [2024-10-31 22:11:46,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 727 states have (on average 1.4497936726272351) internal successors, (1054), 727 states have internal predecessors, (1054), 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:11:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1054 transitions. [2024-10-31 22:11:46,256 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1054 transitions. Word has length 71 [2024-10-31 22:11:46,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:46,256 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1054 transitions. [2024-10-31 22:11:46,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:11:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1054 transitions. [2024-10-31 22:11:46,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-31 22:11:46,258 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:46,258 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:46,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 22:11:46,258 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:46,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1277851670, now seen corresponding path program 1 times [2024-10-31 22:11:46,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:46,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657736779] [2024-10-31 22:11:46,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:46,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:46,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657736779] [2024-10-31 22:11:46,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657736779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:46,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:46,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:11:46,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215340213] [2024-10-31 22:11:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:46,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:11:46,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:46,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:11:46,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:46,548 INFO L87 Difference]: Start difference. First operand 728 states and 1054 transitions. Second operand has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:11:46,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:46,757 INFO L93 Difference]: Finished difference Result 1344 states and 1956 transitions. [2024-10-31 22:11:46,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:11:46,758 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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) Word has length 71 [2024-10-31 22:11:46,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:46,760 INFO L225 Difference]: With dead ends: 1344 [2024-10-31 22:11:46,761 INFO L226 Difference]: Without dead ends: 735 [2024-10-31 22:11:46,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:11:46,762 INFO L432 NwaCegarLoop]: 862 mSDtfsCounter, 5 mSDsluCounter, 5148 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 6010 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:46,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 6010 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:46,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-31 22:11:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 718. [2024-10-31 22:11:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4560669456066946) internal successors, (1044), 717 states have internal predecessors, (1044), 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:11:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1044 transitions. [2024-10-31 22:11:46,784 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1044 transitions. Word has length 71 [2024-10-31 22:11:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:46,785 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1044 transitions. [2024-10-31 22:11:46,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.875) internal successors, (71), 8 states have internal predecessors, (71), 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:11:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1044 transitions. [2024-10-31 22:11:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-31 22:11:46,786 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:46,786 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:46,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 22:11:46,787 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:46,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash -668387598, now seen corresponding path program 1 times [2024-10-31 22:11:46,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:46,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277508364] [2024-10-31 22:11:46,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:47,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:47,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277508364] [2024-10-31 22:11:47,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277508364] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:47,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:47,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:11:47,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203298588] [2024-10-31 22:11:47,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:47,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:11:47,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:47,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:11:47,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:47,191 INFO L87 Difference]: Start difference. First operand 718 states and 1044 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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:11:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:47,566 INFO L93 Difference]: Finished difference Result 1323 states and 1932 transitions. [2024-10-31 22:11:47,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:11:47,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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) Word has length 71 [2024-10-31 22:11:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:47,569 INFO L225 Difference]: With dead ends: 1323 [2024-10-31 22:11:47,570 INFO L226 Difference]: Without dead ends: 729 [2024-10-31 22:11:47,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:11:47,571 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 826 mSDsluCounter, 3356 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 4206 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:47,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 4206 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:11:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2024-10-31 22:11:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 718. [2024-10-31 22:11:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4560669456066946) internal successors, (1044), 717 states have internal predecessors, (1044), 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:11:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1044 transitions. [2024-10-31 22:11:47,588 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1044 transitions. Word has length 71 [2024-10-31 22:11:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:47,588 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1044 transitions. [2024-10-31 22:11:47,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 7 states have internal predecessors, (71), 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:11:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1044 transitions. [2024-10-31 22:11:47,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-31 22:11:47,589 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:47,589 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:47,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 22:11:47,590 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:47,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:47,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1572057892, now seen corresponding path program 1 times [2024-10-31 22:11:47,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:47,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578664084] [2024-10-31 22:11:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:47,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:47,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:47,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:47,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:47,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578664084] [2024-10-31 22:11:47,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578664084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:47,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:47,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:47,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587745799] [2024-10-31 22:11:47,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:47,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:47,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:47,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:47,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:47,801 INFO L87 Difference]: Start difference. First operand 718 states and 1044 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:11:47,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:47,926 INFO L93 Difference]: Finished difference Result 1329 states and 1941 transitions. [2024-10-31 22:11:47,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:47,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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) Word has length 72 [2024-10-31 22:11:47,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:47,929 INFO L225 Difference]: With dead ends: 1329 [2024-10-31 22:11:47,931 INFO L226 Difference]: Without dead ends: 718 [2024-10-31 22:11:47,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:47,932 INFO L432 NwaCegarLoop]: 844 mSDtfsCounter, 879 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:47,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 1680 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:47,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2024-10-31 22:11:47,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 718. [2024-10-31 22:11:47,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 718 states, 717 states have (on average 1.4532775453277544) internal successors, (1042), 717 states have internal predecessors, (1042), 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:11:47,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1042 transitions. [2024-10-31 22:11:47,950 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1042 transitions. Word has length 72 [2024-10-31 22:11:47,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:47,950 INFO L471 AbstractCegarLoop]: Abstraction has 718 states and 1042 transitions. [2024-10-31 22:11:47,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 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:11:47,951 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1042 transitions. [2024-10-31 22:11:47,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-31 22:11:47,951 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:47,952 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:47,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-31 22:11:47,952 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:47,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:47,953 INFO L85 PathProgramCache]: Analyzing trace with hash 410843117, now seen corresponding path program 1 times [2024-10-31 22:11:47,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:47,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708680353] [2024-10-31 22:11:47,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:47,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:47,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:48,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:48,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:48,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708680353] [2024-10-31 22:11:48,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708680353] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:48,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:48,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:11:48,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973873518] [2024-10-31 22:11:48,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:48,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:11:48,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:48,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:11:48,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:11:48,305 INFO L87 Difference]: Start difference. First operand 718 states and 1042 transitions. Second operand has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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:11:48,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:48,533 INFO L93 Difference]: Finished difference Result 1336 states and 1946 transitions. [2024-10-31 22:11:48,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:11:48,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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) Word has length 73 [2024-10-31 22:11:48,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:48,537 INFO L225 Difference]: With dead ends: 1336 [2024-10-31 22:11:48,537 INFO L226 Difference]: Without dead ends: 716 [2024-10-31 22:11:48,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:11:48,539 INFO L432 NwaCegarLoop]: 840 mSDtfsCounter, 1693 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 3332 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:48,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 3332 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:11:48,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2024-10-31 22:11:48,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 715. [2024-10-31 22:11:48,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 714 states have (on average 1.4509803921568627) internal successors, (1036), 714 states have internal predecessors, (1036), 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:11:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1036 transitions. [2024-10-31 22:11:48,556 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1036 transitions. Word has length 73 [2024-10-31 22:11:48,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:48,557 INFO L471 AbstractCegarLoop]: Abstraction has 715 states and 1036 transitions. [2024-10-31 22:11:48,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.428571428571429) internal successors, (73), 7 states have internal predecessors, (73), 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:11:48,557 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1036 transitions. [2024-10-31 22:11:48,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-31 22:11:48,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:48,558 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:48,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-31 22:11:48,558 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:48,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:48,559 INFO L85 PathProgramCache]: Analyzing trace with hash 228712370, now seen corresponding path program 1 times [2024-10-31 22:11:48,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:48,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658287483] [2024-10-31 22:11:48,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:48,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:48,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:11:48,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:11:48,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:11:48,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658287483] [2024-10-31 22:11:48,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658287483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:11:48,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:11:48,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:11:48,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958319441] [2024-10-31 22:11:48,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:11:48,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:11:48,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:11:48,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:11:48,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:11:48,739 INFO L87 Difference]: Start difference. First operand 715 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:11:48,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:11:48,939 INFO L93 Difference]: Finished difference Result 1319 states and 1921 transitions. [2024-10-31 22:11:48,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:11:48,943 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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) Word has length 73 [2024-10-31 22:11:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:11:48,947 INFO L225 Difference]: With dead ends: 1319 [2024-10-31 22:11:48,947 INFO L226 Difference]: Without dead ends: 717 [2024-10-31 22:11:48,948 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:11:48,949 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 826 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1697 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:11:48,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1697 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:11:48,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2024-10-31 22:11:48,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 707. [2024-10-31 22:11:48,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 706 states have (on average 1.453257790368272) internal successors, (1026), 706 states have internal predecessors, (1026), 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:11:48,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1026 transitions. [2024-10-31 22:11:48,967 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1026 transitions. Word has length 73 [2024-10-31 22:11:48,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:11:48,967 INFO L471 AbstractCegarLoop]: Abstraction has 707 states and 1026 transitions. [2024-10-31 22:11:48,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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:11:48,968 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1026 transitions. [2024-10-31 22:11:48,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-31 22:11:48,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:11:48,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:48,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-31 22:11:48,969 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:11:48,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:11:48,969 INFO L85 PathProgramCache]: Analyzing trace with hash 420694957, now seen corresponding path program 1 times [2024-10-31 22:11:48,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:11:48,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182749777] [2024-10-31 22:11:48,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:11:48,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:11:49,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:11:49,038 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:11:49,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:11:49,142 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:11:49,142 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:11:49,144 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:11:49,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-31 22:11:49,149 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:11:49,237 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:11:49,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:11:49 BoogieIcfgContainer [2024-10-31 22:11:49,240 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:11:49,241 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:11:49,241 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:11:49,241 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:11:49,241 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:11:34" (3/4) ... [2024-10-31 22:11:49,244 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:11:49,245 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:11:49,246 INFO L158 Benchmark]: Toolchain (without parser) took 19441.76ms. Allocated memory was 155.2MB in the beginning and 421.5MB in the end (delta: 266.3MB). Free memory was 117.4MB in the beginning and 332.7MB in the end (delta: -215.2MB). Peak memory consumption was 52.3MB. Max. memory is 16.1GB. [2024-10-31 22:11:49,246 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 125.8MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:11:49,247 INFO L158 Benchmark]: CACSL2BoogieTranslator took 763.73ms. Allocated memory is still 155.2MB. Free memory was 116.9MB in the beginning and 88.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-31 22:11:49,247 INFO L158 Benchmark]: Boogie Procedure Inliner took 312.03ms. Allocated memory is still 155.2MB. Free memory was 88.1MB in the beginning and 98.7MB in the end (delta: -10.7MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. [2024-10-31 22:11:49,247 INFO L158 Benchmark]: Boogie Preprocessor took 233.73ms. Allocated memory is still 155.2MB. Free memory was 98.7MB in the beginning and 78.6MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-31 22:11:49,248 INFO L158 Benchmark]: RCFGBuilder took 3105.57ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 78.6MB in the beginning and 112.9MB in the end (delta: -34.3MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. [2024-10-31 22:11:49,248 INFO L158 Benchmark]: TraceAbstraction took 15014.72ms. Allocated memory was 239.1MB in the beginning and 421.5MB in the end (delta: 182.5MB). Free memory was 111.8MB in the beginning and 333.7MB in the end (delta: -221.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:11:49,248 INFO L158 Benchmark]: Witness Printer took 4.88ms. Allocated memory is still 421.5MB. Free memory was 333.7MB in the beginning and 332.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:11:49,250 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.22ms. Allocated memory is still 125.8MB. Free memory is still 72.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 763.73ms. Allocated memory is still 155.2MB. Free memory was 116.9MB in the beginning and 88.1MB in the end (delta: 28.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 312.03ms. Allocated memory is still 155.2MB. Free memory was 88.1MB in the beginning and 98.7MB in the end (delta: -10.7MB). Peak memory consumption was 49.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 233.73ms. Allocated memory is still 155.2MB. Free memory was 98.7MB in the beginning and 78.6MB in the end (delta: 20.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * RCFGBuilder took 3105.57ms. Allocated memory was 155.2MB in the beginning and 239.1MB in the end (delta: 83.9MB). Free memory was 78.6MB in the beginning and 112.9MB in the end (delta: -34.3MB). Peak memory consumption was 64.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15014.72ms. Allocated memory was 239.1MB in the beginning and 421.5MB in the end (delta: 182.5MB). Free memory was 111.8MB in the beginning and 333.7MB in the end (delta: -221.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.88ms. Allocated memory is still 421.5MB. Free memory was 333.7MB in the beginning and 332.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of shiftRight at line 109, overapproximation of bitwiseAnd at line 116. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 5); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (5 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 16); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (16 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_3 var_5 = 0; [L39] const SORT_1 var_12 = 0; [L40] const SORT_4 var_27 = 500; [L41] const SORT_3 var_28 = 1; [L42] const SORT_3 var_30 = 0; [L43] const SORT_4 var_32 = 16; [L44] const SORT_4 var_79 = 200; [L46] SORT_1 input_37; [L47] SORT_1 input_38; [L48] SORT_1 input_43; [L49] SORT_1 input_48; [L50] SORT_1 input_52; [L51] SORT_1 input_57; [L53] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L53] SORT_3 state_6 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L54] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_3=65535, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L54] SORT_3 state_8 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L55] EXPR __VERIFIER_nondet_ushort() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L55] SORT_3 state_10 = __VERIFIER_nondet_ushort() & mask_SORT_3; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L56] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L57] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L58] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L59] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L60] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L61] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, var_12=0, var_27=500, var_28=1, var_30=0, var_32=16, var_5=0, var_79=200] [L62] SORT_1 state_25 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L64] SORT_3 init_7_arg_1 = var_5; [L65] state_6 = init_7_arg_1 [L66] SORT_3 init_9_arg_1 = var_5; [L67] state_8 = init_9_arg_1 [L68] SORT_3 init_11_arg_1 = var_5; [L69] state_10 = init_11_arg_1 [L70] SORT_1 init_14_arg_1 = var_12; [L71] state_13 = init_14_arg_1 [L72] SORT_1 init_16_arg_1 = var_12; [L73] state_15 = init_16_arg_1 [L74] SORT_1 init_18_arg_1 = var_12; [L75] state_17 = init_18_arg_1 [L76] SORT_1 init_20_arg_1 = var_12; [L77] state_19 = init_20_arg_1 [L78] SORT_1 init_22_arg_1 = var_12; [L79] state_21 = init_22_arg_1 [L80] SORT_1 init_24_arg_1 = var_12; [L81] state_23 = init_24_arg_1 [L82] SORT_1 init_26_arg_1 = var_12; [L83] state_25 = init_26_arg_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L86] input_37 = __VERIFIER_nondet_uchar() [L87] EXPR input_37 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L87] input_37 = input_37 & mask_SORT_1 [L88] input_38 = __VERIFIER_nondet_uchar() [L89] EXPR input_38 & mask_SORT_1 VAL [input_37=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L89] input_38 = input_38 & mask_SORT_1 [L90] input_43 = __VERIFIER_nondet_uchar() [L91] EXPR input_43 & mask_SORT_1 VAL [input_37=0, input_38=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L91] input_43 = input_43 & mask_SORT_1 [L92] input_48 = __VERIFIER_nondet_uchar() [L93] EXPR input_48 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L93] input_48 = input_48 & mask_SORT_1 [L94] input_52 = __VERIFIER_nondet_uchar() [L95] EXPR input_52 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L95] input_52 = input_52 & mask_SORT_1 [L96] input_57 = __VERIFIER_nondet_uchar() [L97] EXPR input_57 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_6=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L97] input_57 = input_57 & mask_SORT_1 [L100] SORT_3 var_29_arg_0 = var_28; [L101] SORT_3 var_29_arg_1 = state_6; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29_arg_0=1, var_29_arg_1=0, var_30=0, var_32=16, var_79=200] [L102] EXPR var_29_arg_0 ^ var_29_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_30=0, var_32=16, var_79=200] [L102] SORT_3 var_29 = var_29_arg_0 ^ var_29_arg_1; [L103] SORT_3 var_31_arg_0 = var_29; [L104] SORT_3 var_31_arg_1 = var_30; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_31_arg_0=1, var_31_arg_1=0, var_32=16, var_79=200] [L105] EXPR ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L105] SORT_4 var_31 = ((SORT_4)var_31_arg_0 << 16) | var_31_arg_1; [L106] SORT_4 var_33_arg_0 = var_31; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_79=200] [L107] EXPR var_33_arg_0 | ~mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L107] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_79=200] [L107] var_33_arg_0 = (var_33_arg_0 & msb_SORT_4) ? (var_33_arg_0 | ~mask_SORT_4) : (var_33_arg_0 & mask_SORT_4) [L108] SORT_4 var_33_arg_1 = var_32; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=200] [L109] EXPR (int)var_33_arg_0 >> var_33_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_0=65536, var_33_arg_1=16, var_79=200] [L109] SORT_4 var_33 = (int)var_33_arg_0 >> var_33_arg_1; [L110] EXPR var_33_arg_0 & msb_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L110] EXPR (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=200] [L110] var_33 = (var_33_arg_0 & msb_SORT_4) ? (var_33 | ~(mask_SORT_4 >> var_33_arg_1)) : var_33 [L111] EXPR var_33 & mask_SORT_4 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33_arg_1=16, var_79=200] [L111] var_33 = var_33 & mask_SORT_4 [L112] SORT_4 var_34_arg_0 = var_27; [L113] SORT_4 var_34_arg_1 = var_33; [L114] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L115] SORT_1 var_35_arg_0 = ~state_25; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_34=1, var_35_arg_0=-1, var_79=200] [L116] EXPR var_35_arg_0 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_34=1, var_79=200] [L116] var_35_arg_0 = var_35_arg_0 & mask_SORT_1 [L117] SORT_1 var_35_arg_1 = var_34; VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_35_arg_0=1, var_35_arg_1=1, var_79=200] [L118] EXPR var_35_arg_0 & var_35_arg_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L118] SORT_1 var_35 = var_35_arg_0 & var_35_arg_1; [L119] EXPR var_35 & mask_SORT_1 VAL [input_37=0, input_38=0, input_43=0, input_48=0, input_52=0, input_57=0, mask_SORT_1=1, mask_SORT_4=-1, msb_SORT_4=2147483648, state_10=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_8=0, var_27=500, var_28=1, var_29=1, var_30=0, var_32=16, var_33=500, var_33_arg_1=16, var_79=200] [L119] var_35 = var_35 & mask_SORT_1 [L120] SORT_1 bad_36_arg_0 = var_35; [L121] CALL __VERIFIER_assert(!(bad_36_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 597 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 23, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12814 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12814 mSDsluCounter, 79495 SdHoareTripleChecker+Invalid, 3.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60715 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3405 IncrementalHoareTripleChecker+Invalid, 3428 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 18780 mSDtfsCounter, 3405 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=728occurred in iteration=17, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 547 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 1541 NumberOfCodeBlocks, 1541 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1446 ConstructedInterpolants, 0 QuantifiedInterpolants, 4939 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:11:49,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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 64bit --witnessprinter.graph.data.programhash 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:11:51,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:11:51,892 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-31 22:11:51,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:11:51,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:11:51,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:11:51,921 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:11:51,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:11:51,923 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:11:51,923 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:11:51,924 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:11:51,924 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:11:51,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:11:51,925 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:11:51,926 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:11:51,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:11:51,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:11:51,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:11:51,928 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:11:51,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:11:51,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:11:51,929 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:11:51,929 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:11:51,930 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:11:51,930 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:11:51,930 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:11:51,931 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:11:51,931 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:11:51,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:11:51,932 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:11:51,932 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:11:51,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:11:51,933 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:11:51,933 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:11:51,933 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:11:51,934 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:11:51,934 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:11:51,935 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:11:51,935 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:11:51,935 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:11:51,936 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:11:51,936 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:11:51,936 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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f01dddb47b5ae1b5d3586b27b8ee34d6afc00308bb90167839574641d1f43c9 [2024-10-31 22:11:52,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:11:52,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:11:52,348 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:11:52,350 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:11:52,351 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:11:52,352 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c Unable to find full path for "g++" [2024-10-31 22:11:54,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:11:55,136 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:11:55,138 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c [2024-10-31 22:11:55,169 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/data/b65f9b875/44b5cfd6e0044eee81148719db24f93c/FLAG17d2cf27a [2024-10-31 22:11:55,198 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fdf40c62-cfd3-476f-b54f-ad73c85a0325/bin/uautomizer-verify-4GaUIPS5ZU/data/b65f9b875/44b5cfd6e0044eee81148719db24f93c [2024-10-31 22:11:55,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:11:55,206 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:11:55,208 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:11:55,208 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:11:55,215 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:11:55,216 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:55" (1/1) ... [2024-10-31 22:11:55,217 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de23bca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:11:55, skipping insertion in model container [2024-10-31 22:11:55,217 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:11:55" (1/1) ... [2024-10-31 22:11:55,286 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:11:55,614 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_fdf40c62-cfd3-476f-b54f-ad73c85a0325/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.adding.2.prop1-func-interl.c[1173,1186]